def quick_sort(li, left, right):
if left < right:
mid = partition(li, left, right)
quick_sort(li, left, mid-1)
quick_sort(li, mid+1, right)
def partition(li, left, right):
temp = li[left]
while left < right:
while left < right and li[right] >= temp: # 从右边找比tmp小的数
right -= 1 # 往左走一步
li[left] = li[right] # 把右边的值放到左边空位上
while left < right and li[left] <= temp:
left += 1
li[right] = li[left] # 把左边的值放到右边空位上
li[left] = temp # 把tmp归位
return left # 返回中间值的下标,left或者right都可以
li = [5, 6, 4, 2, 7, 8, 1, 3]
quick_sort(li, 0, len(li) - 1)
print(li)
快速排序算法
最新推荐文章于 2024-07-19 17:17:54 发布