def partition(lst,p,q):
l=p-1
r=q
key=lst[r]
for i in range(p,q):
if(lst[i]<key):
l+=1
tmp=lst[i]
lst[i]=lst[l]
lst[l]=tmp
l+=1
tmp=lst[l]
lst[l]=key
lst[r]=tmp
return l
def quickSort(lst,p,q):
if(p<q):
r=partition(lst,p,q)
quickSort(lst,p,r-1)
quickSort(lst,r+1,q)
lst=[22,33,55,11,23,24,98,1,5,2]
quickSort(lst,0,9)
print(lst)
python quickSort
最新推荐文章于 2024-05-14 10:51:55 发布