Python八大排序之-----快速排序（分治算法）

def quicksort(listone):
    if len(listone) < 1:
        return listone
    else:
        num = listone[0]
        less = [i for i in listone[1:] if i < num]
        rest = [i for i in listone[1:] if i > num]
        return quicksort(less)+[num]+quicksort(rest)
listone = input("请输入你要排序的玩意儿：")
listone = listone.split(',')
L = []
for v in listone:
        c = int(v)
        L.append(c)
print(quicksort(L))