Update sorts/quick_sort_3_partition.py#2507
Update sorts/quick_sort_3_partition.py#2507cclauss merged 4 commits intoTheAlgorithms:masterfrom taseikyo:patch
Conversation
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.
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.
Co-authored-by: Christian Clauss <cclauss@me.com>
* 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 <cclauss@me.com> Co-authored-by: Christian Clauss <cclauss@me.com>
* 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 <cclauss@me.com> Co-authored-by: Christian Clauss <cclauss@me.com>
Another quick sort algorithm, returns a new sorted list
Describe your change:
Checklist:
Fixes: #{$ISSUE_NO}.