quick_sort.py

def quick_sort(src):
    print(f"**: {src}")
    if len(src) <= 1:
        return src

    pivot = src[0]
    left = list()
    right = list()
    for n in src[1:]:
        if n < pivot:
            left.append(n)
        else:
            right.append(n)
    return quick_sort(left) + [pivot] + quick_sort(right)


def sort(src):
    return quick_sort(src)


if __name__ == "__main__":
    import random

    src = random.sample(range(3000), k=100)

    print(f"init: {src}")
    result = sort(src)
    print(f"result: {result}")