Sunbelt Computer Software

PL/B Language Development and Support

algorithms-python/sorts/recursive_quick_sort.py at master · zinating/algorithms-python · GitHub

22 lines (19 loc) · 486 Bytes

def quick_sort(data: list) -> list:

"""

>>> for data in ([2, 1, 0], [2.2, 1.1, 0], "quick_sort"):

... quick_sort(data) == sorted(data)

True

"""

if len(data) <= 1:

return data

else:

return (

quick_sort([e for e in data[1:] if e <= data[0]])

+ [data[0]]

+ quick_sort([e for e in data[1:] if e > data[0]])

)

if __name__ == "__main__":

import doctest

doctest.testmod()