python_快速排序

概述def quickSort(mylist): if len(mylist) <= 1: return mylist list1,list2,list3 = [],[],[] for x in range(len(mylist)): if mylist[x] < mylist[0]: list1.append(mylist[x]) elif mylist[x] == mylist[0]: list2

def quickSort(myList):
if len(myList) <= 1:
return myList
List1,List2,List3 = [],[],[]
for x in range(len(myList)):
if myList[x] < myList[0]:
List1.append(myList[x])
elif myList[x] == myList[0]:
List2.append(myList[x])
else:
List3.append(myList[x])
return quickSort(List1) + List2 + quickSort(List3)

 

def quickSort1(myList,start,end):
if len(myList) <= 1 or start <= end:
return
low = start
high = end
key = myList[start]
while start<end:
while myList[end]>key and start<end:
end += 1
myList[start] = myList[end]
while myList[start]<=key and start<end:
start +=1
myList[end] = myList[start]
myList[start] = key
quickSort1(myList,low,start-1)
quickSort1(myList,start+1,high)

 

lList = [2,5,1,6,87,9,3,2,89,21,5]lList1 = quickSort(lList)print(lList)print(lList1)quickSort1(lList,len(lList)-1)print(lList)

总结

以上是内存溢出为你收集整理的python_快速排序全部内容，希望文章能够帮你解决python_快速排序所遇到的程序开发问题。

如果觉得内存溢出网站内容还不错，欢迎将内存溢出网站推荐给程序员好友。