Implementation of Python Quick sort

The basic idea of fast sorting: to find an element in an unordered list, with this element as the benchmark, all other elements are compared to the element, smaller than the element becomes a sub-sequence, larger than the element becomes another sub-sequence, and then repeat the process, and finally achieve the sorting effect. We also implement it in a recursive way.

def quicksort (list):
    If Len (list) < 2:
        Return list

    Little = []
    large = []
    # take out the first element of the list here
    Middle = list.pop (0)

    For item in list:
        If Item < middle:
            Little.append (item)
        Else
            Large.append (item)

    return Quicksort (Little) +[middle]+quicksort (Large)


Print (Quicksort ([1,4,3,2,1]))

[1, 1, 2, 3, 4]

Process finished with exit code 0

　　

Implementation of Python Quick sort