Add Tournament Sort implementation#1579
Closed
drori12 wants to merge 1 commit into
Closed
Conversation
drori12
requested review from
Panquesito7,
alexpantyukhin and
tjgurwara99
as code owners
Contributor
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
Contributor
|
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions! |
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Description of Change
Added Tournament Sort algorithm implementation in C. Tournament Sort improves
upon naive Selection Sort by using a min-heap to find the minimum element in
O(log n) instead of O(n), achieving O(n log n) overall time complexity.
References
https://en.wikipedia.org/wiki/Tournament_sort
Checklist
Notes: Tournament Sort implementation with 6 test cases covering unsorted, sorted, reverse sorted, single element, duplicates, and negative numbers.