python快速排序,这个是从小到大排序的。从大到替换left right即可
备份
def quick_xiao(list_x):
if len(list_x) <=1:
return list_x
else:
p = list_x[0]
left = quick_xiao([x for x in list_x[1:] if x < p])
right = quick_xiao([x for x in list_x[1:] if x >= p])
return left + [p] + right



