快速排序

def f(l):
    if len(l) < 2:
        return l
    less = [i for i in l[1:] if i <= l[0]]
    more = [i for i in l[1:] if i > l[0]]
    return f(less) + [l[0]] + f(more)


import random
a = [random.randint(1, 1000) for i in range(20)]
print(f(a))