python实现快速排序
#快速排序
def quick_sort(arrary):
if len(arrary) < 2:
return arrary
else:
left ,right = [],[]
mid = arrary[len(arrary)//2]
arrary.remove(mid)
for num in arrary:
if num >= mid:
right.append(num)
else:
left.append(num)
return quick_sort(left) + [mid] +quick_sort(right) #递归
l = [5,9,10,14,45,1,3,9,25,250]
a = quick_sort(l)
print(a)