Module pywander.algorithm.sort.quick_sort

Functions

def quick_sort(seq)

Expand source code

def quick_sort(seq):
    """
    10000 random number seq ：
    select_sort use time 3.0919713973999023
    quick sort use time 0.024930477142333984

    """
    if not isinstance(seq, list):
        raise Exception("seq should be a list.")

    if len(seq) < 2:
        return seq
    else:
        pivot = seq[0]

        less_part = [i for i in seq[1:] if i <= pivot]

        greater_part = [i for i in seq[1:] if i > pivot]

        return quick_sort(less_part) + [pivot] + quick_sort(greater_part)

10000 random number seq ： select_sort use time 3.0919713973999023 quick sort use time 0.024930477142333984