def Quick_Sort(list):
if len(list) < 2:
return list
else:
temp = list[0]
less = [i for i in list[1:] if i <= temp]
more = [i for i in list[1:] if i > temp]
return Quick_Sort(less) + [temp] + Quick_Sort(more)
testArr = [11,23,56,89,897,123,546]
print(Quick_Sort(testArr))
Python : 算法快速排序
最新推荐文章于 2022-03-08 18:23:14 发布