Python/sorts/quick_sort.py at patch-1 · mehrajcode/Python

39 lines (31 loc) · 1.14 KB

"""

A pure Python implementation of the quick sort algorithm

For doctests run following command:

python3 -m doctest -v quick_sort.py

For manual testing run:

python3 quick_sort.py

"""

def quick_sort(collection: list) -> list:

"""A pure Python implementation of quick sort algorithm

:param collection: a mutable collection of comparable items

:return: the same collection ordered by ascending

Examples:

>>> quick_sort([0, 5, 3, 2, 2])

[0, 2, 2, 3, 5]

>>> quick_sort([])

[]

>>> quick_sort([-2, 5, 0, -45])

[-45, -2, 0, 5]

"""

if len(collection) < 2:

return collection

pivot = collection.pop() # Use the last element as the first pivot

greater = [] # All elements greater than pivot

lesser = [] # All elements less than or equal to pivot

for element in collection:

(greater if element > pivot else lesser).append(element)

return quick_sort(lesser) + [pivot] + quick_sort(greater)

if __name__ == "__main__":

user_input = input("Enter numbers separated by a comma:\n").strip()

unsorted = [int(item) for item in user_input.split(",")]

print(quick_sort(unsorted))

Provide feedback