mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-22 17:22:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

add doctest for quick_sort_3_partition (#11779)

Browse Source
This commit is contained in:
Giulio Tantaro 2024-12-30 21:03:31 +01:00 committed by GitHub
parent 8921b56a85
commit 5942059cb5
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 23 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
sorts/quick_sort_3_partition.py
View File

@ -1,4 +1,27 @@
def quick_sort_3partition(sorting: list, left: int, right: int) -> None: def quick_sort_3partition(sorting: list, left: int, right: int) -> None:
""" "
Python implementation of quick sort algorithm with 3-way partition.
The idea of 3-way quick sort is based on "Dutch National Flag algorithm".
:param sorting: sort list
:param left: left endpoint of sorting
:param right: right endpoint of sorting
:return: None
Examples:
>>> array1 = [5, -1, -1, 5, 5, 24, 0]
>>> quick_sort_3partition(array1, 0, 6)
>>> array1
[-1, -1, 0, 5, 5, 5, 24]
>>> array2 = [9, 0, 2, 6]
>>> quick_sort_3partition(array2, 0, 3)
>>> array2
[0, 2, 6, 9]
>>> array3 = []
>>> quick_sort_3partition(array3, 0, 0)
>>> array3
[]
"""
if right <= left: if right <= left:
return return
a = i = left a = i = left