Three-way partioning Quick Sort #19
Open
Conversation
This file contains 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
|
It seems that the function |
|
At this point it seems like we can just drop 0.3 support. |
ararslan
approved these changes
Mar 12, 2017
|
It's been like 4 years. Close it, or merge it or start another repo. |
|
I'm willing to merge it if somebody rebases it against master (and tests pass). |
nalimilan
reviewed
Oct 19, 2020
| @@ -8,6 +8,7 @@ | |||
| The `SortingAlgorithms` package provides three sorting algorithms that can be used with Julia's [standard sorting API](http://docs.julialang.org/en/latest/stdlib/sort/): | |||
|
|
|||
| - [HeapSort] – an unstable, general purpose, in-place, O(n log n) comparison sort that works by heapifying an array and repeatedly taking the maximal element from the heap. | |||
| - QuickSort3 - an unstable, general purpose, in-place, O(n log n) comparison sort variation of the classic QuickSort that uses a three-way partion algorithm. It can be 1.1x slower than QuickSort in base but works in near O(n) time when there are few unique values in the array. | |||
There was a problem hiding this comment.
Suggested change
| - QuickSort3 - an unstable, general purpose, in-place, O(n log n) comparison sort variation of the classic QuickSort that uses a three-way partion algorithm. It can be 1.1x slower than QuickSort in base but works in near O(n) time when there are few unique values in the array. | |
| - QuickSort3 - an unstable, general purpose, in-place, O(n log n) comparison sort variation of the classic QuickSort that uses a three-way partitioning algorithm. It can be 1.1x slower than QuickSort in base but works in near O(n) time when there are few unique values in the array. |
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 is basically the
QuickSortin base with a small change to handle repeated values. It should be less than 1.15x slower than one in base in general but near O(n) time for arrays with few unique keysCC @kmsquire