Added Heap sort, tests, and documentation. #36
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Fixed test call for tree sort.
abranhe
approved these changes
Oct 2, 2019
There was a problem hiding this comment.
Thank you so much for your contribution. Without people like you submitting pull requests we couldn't run this project.
💪 You rock @DatHydroGuy
abranhe
approved these changes
Oct 6, 2019
There was a problem hiding this comment.
Thanks so much for your contribution to The All ▲lgorithms Project. Without people like you submitting Pull Requests we couldn't run this project. You rock @DatHydroGuy
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
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.