def quick_sort(arr):
if len(arr) <= 1:
return arr
mid = arr[0]
left = []
equal = []
right = []
while arr:
element = arr[0]
if element > mid:
right.append(element)
elif element < mid:
left.append(element)
else:
equal.append(element)
arr.pop(0)
left = quick_sort(left)
right = quick_sort(right)
return left+equal+right
快速排序-python-递归
猜你喜欢
转载自blog.csdn.net/weixin_42766102/article/details/89646500
今日推荐
周排行