- Notifications
You must be signed in to change notification settings - Fork25
Added Heap sort, tests, and documentation.#36
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Uh oh!
There was an error while loading.Please reload this page.
Conversation
Fixed test call for tree sort.
abranhe left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Thank you so much for your contribution. Without people like you submitting pull requests we couldn't run this project.
💪 You rock@DatHydroGuy
abranhe left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Thanks so much for your contribution toThe All ▲lgorithms Project. Without people like you submitting Pull Requests we couldn't run this project. You rock@DatHydroGuy
This pull request is:
This pull request fixes:
issue#23
Changes:
Added heap sort algorithm. This is an in-place sort, so the function does not have a return statement. This also explains why the unit test looks a little different to the others. This can be easily modified to return the sorted array, but that removes the advantage of the in-place sort.