Quick Sort (ii)

Code:

# Quick Sort
# Three line code implementation quick Sort

# first line of code: Define functions and Parameters
def quick_sort (lists):
    # The second line of code: Determine whether the list length is less than 1, if less than or equal to 1, directly return the list
    If Len (lists) <= 1:return lists
    # Third line of code: Returns the list of recursive function stitching
    # All elements that are smaller than the first element of the list recursively call
    # The first element
    # List of all elements that are larger than the first element of the list recursively calls
    return Quick_sort ([i-I in lists[1:] if I < lists[0]]) \
           + lists[0:1] \
           + quick_s ORT ([I for I lists[1:] if I >= lists[0]])


if __name__ = = "__main__":
    lists = [6, 1, 2, 7, 9, 3, 4, 5, 10, 8]
    Print (quick_sort (lists))

Operation Result:

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]