Update sorts/quick_sort_3_partition.py #2507
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
Another quick sort algorithm, returns a new sorted list
|
Hey @taseikyo, TravisCI finished with status TravisBuddy Request Identifier: 0386d740-0206-11eb-aba2-872ffb2742c8 |
rename quick_sort_3partition to quick_sort_3part
Yes, we are implementing https://en.wikipedia.org/wiki/Quicksort#Three-way_radix_quicksort. First divide the list into three parts. Then recursively sort the "less than" and "greater than" partitions. |
rename quick_sort_3part to three_way_radix_quicksort Three-way radix quicksort: https://en.wikipedia.org/wiki/Quicksort#Three-way_radix_quicksort First divide the list into three parts. Then recursively sort the "less than" and "greater than" partitions.
cclauss
reviewed
Sep 29, 2020
sorts/quick_sort_3_partition.py
Outdated
| @@ -1,4 +1,4 @@ | |||
| def quick_sort_3partition(sorting: list, left: int, right: int) -> list: | |||
| def quick_sort_3partition(sorting: list, left: int, right: int): | |||
There was a problem hiding this comment.
quick_sort_3partition does not return a new list, it just updates in place. So I remove -> list.
taseikyo
changed the title
cclauss
reviewed
Sep 29, 2020
Co-authored-by: Christian Clauss <[email protected]>
cclauss
approved these changes
Sep 29, 2020
stokhos
pushed a commit
to stokhos/Python
that referenced
this pull request
Jan 3, 2021
* Update sorts/quick_sort_3partition.py Another quick sort algorithm, returns a new sorted list * Update sorts/quick_sort_3_partition.py rename quick_sort_3partition to quick_sort_3part * Update sorts/quick_sort_3_partition.py rename quick_sort_3part to three_way_radix_quicksort Three-way radix quicksort: https://en.wikipedia.org/wiki/Quicksort#Three-way_radix_quicksort First divide the list into three parts. Then recursively sort the "less than" and "greater than" partitions. * Update sorts/quick_sort_3_partition.py Co-authored-by: Christian Clauss <[email protected]> Co-authored-by: Christian Clauss <[email protected]>
Panquesito7
pushed a commit
to Panquesito7/Python
that referenced
this pull request
May 13, 2021
* Update sorts/quick_sort_3partition.py Another quick sort algorithm, returns a new sorted list * Update sorts/quick_sort_3_partition.py rename quick_sort_3partition to quick_sort_3part * Update sorts/quick_sort_3_partition.py rename quick_sort_3part to three_way_radix_quicksort Three-way radix quicksort: https://en.wikipedia.org/wiki/Quicksort#Three-way_radix_quicksort First divide the list into three parts. Then recursively sort the "less than" and "greater than" partitions. * Update sorts/quick_sort_3_partition.py Co-authored-by: Christian Clauss <[email protected]> Co-authored-by: Christian Clauss <[email protected]>
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.
Another quick sort algorithm, returns a new sorted list
Describe your change:
Checklist:
Fixes: #{$ISSUE_NO}.