#非稳定排序算法
def quick_sort(shuzu,start,end):
if start<=end:
low=start
high=end
mid=shuzu[low]
while low<high:
while low<high and shuzu[high]>=mid:
high-= 1
shuzu[low] = shuzu[high]
while low<high and shuzu[low]<mid:
low+=1
shuzu[high]=shuzu[low]
shuzu[low]=mid
quick_sort(shuzu,start,low-1)
quick_sort(shuzu,low+1,end)
import time
if __name__=='__main__':
t1=time.time()
a=[1,2,5,79,8,5,634,6,6,3]
n=len(a)
quick_sort(a,0,n-1)
t2 = time.time()
print(a)
print(t2-t1)
测试结果