def quickSort(array):
less = []
greater = []
if len(array) <= 1:
return array
pivot = array.pop()
for i in array:
if i>pivot :
greater.append(i)
else:
less.append(i)
return quickSort(less) + [pivot] + quickSort(greater)
if __name__ == "__main__":
lis = [1,2,3]
#print(lis.pop())
print(quickSort([2,1,0,8,9,4]))
python简单地实现快速排序
最新推荐文章于 2022-07-12 11:19:48 发布