常用排序算法python实现：快速排序

def quick_sort(list,low,high):
if(low>high):
return;
i,j=low,high
key=list[i]
while(i<j):
#先从末尾扫描
while(i<j and list[j]>=key):
j-=1
if(i<j):
list[i]=list[j]
i+=1
#接着从开始扫描
while(i<j and list[i]<key):
i+=1
if(i<j):
list[j]=list[i]
j-=1
list[i]=key
quick_sort(list, low, i-1)
quick_sort(list, i+1, high)

def quick(list):
quick_sort(list, 0, len(list)-1)

list=[1,5,3,8,9,12,2,2,5,20]

quick(list)
print(list)