feat: add Circle Sort algorithm

[ganeshvenkatasai]

Description

This pull request adds the implementation of the Circle Sort algorithm to the sorting algorithms in the Go repository.

Changes

• Added circlesort.go containing the implementation of Circle Sort.
• Added circlesort_test.go with test cases for the Circle Sort algorithm.

Motivation and Context

Circle Sort is an efficient and lesser known sorting algorithm that can be a useful addition to the repository. It provides a unique approach to sorting, which can be educational for users learning about different sorting techniques.

How Has This Been Tested?

• Implemented test cases in circlesort_test.go to verify the correctness of the Circle Sort algorithm.
• Ran go test ./... to ensure all tests pass successfully.

Checklist:

• My code follows the code style of this project.
• I have performed a self-review of my own code.
• I have commented my code, particularly in hard-to-understand areas.
• I have made corresponding changes to the documentation.
• My changes generate no new warnings.
• I have added tests that prove my fix is effective or that my feature works.
• New and existing unit tests pass locally with my changes.

Related Issue

None

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 87.55%. Comparing base (ee6fef2) to head (67c6df9).

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #730      +/-   ##
==========================================
+ Coverage   87.46%   87.55%   +0.09%     
==========================================
  Files         205      206       +1     
  Lines        5434     5458      +24     
==========================================
+ Hits         4753     4779      +26     
+ Misses        540      539       -1     
+ Partials      141      140       -1     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.