Skip to content

feat: add cycle sort algorithm #634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
May 1, 2023

Conversation

PalAditya
Copy link
Contributor

This adds the cycle sort algorithm. Link for reference: https://en.wikipedia.org/wiki/Cycle_sort

  • Added description of change

  • Added file name matches File name guidelines

  • Added tests and example, test must pass

  • Added documentation so that the program is self-explanatory and educational - GoDoc guidelines

  • Relevant documentation/comments is changed or added

  • PR title follows semantic commit guidelines

  • I acknowledge that all my contributions will be made under the project's license.

Copy link
Member

@tjgurwara99 tjgurwara99 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Good comments in the code! I usually always write to people to explain the question of "why you're doing" in comments instead of "what you're doing" since the latter can be explained by the code itself. You seem to have a correct balance (except for a few places).

@tjgurwara99
Copy link
Member

@siriak @raklaptudirm since I added a commit to the PR, could you both review this as well 🙏🏼

Copy link
Member

@siriak siriak left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Looks good, thanks!

@raklaptudirm raklaptudirm merged commit 0de898f into TheAlgorithms:master May 1, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants