python的快速排序法
def quicksort(list):
if len(list)<=1:
return list
else:
div = array(len(list)//2)
left = [x for x in list if x <div]
middle = [x for x in list if x == div]
right = [x for x in list if x > div]
return quicksort(left)+middle+quicksort(right)