快速排序
第一个元素p将其归位;
列表被分为两部分,左边都比p小,右边都比p大;
递归完成排序;
def partition(li, left, right):
empty = li[left] # 在左侧制造一个空位
print(empty, left, right) # 记录排序的范围
print(li) # 排序前的列表
while left < right:
while left < right and li[right] >= empty: # 因为空位在左侧,从右侧开始直到找到比empty中小的数
right -= 1 # left < right 同时保证不会超出范围
li[left] = li[right] # 将比empty小的数放入左侧空位,此时空位在右侧
print(li, "right") # 打印交换后的列表,此时空位在右侧
while left < right and li[left] <= empty: # 空位在右侧,从左侧开始找
left += 1
li[right] = li[left]
print(li, "left") # 打印交换后的列表,此时空位在左侧
li[left] = empty #把empty归位
print(left) # 打印下次的mid
print(li) # 打印对该范围排序后的列表
return left
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)
return li
s = [2, 5, 1, 6, 7, 3, 9, 8, 4]
print(quick_sort(s, 0, len(s)-1))
2 0 8
[2, 5, 1, 6, 7, 3, 9, 8, 4]
[1, 5, 1, 6, 7, 3, 9, 8, 4] right
[1, 5, 5, 6, 7, 3, 9, 8, 4] left
[1, 5, 5, 6, 7, 3, 9, 8, 4] right
[1, 5, 5, 6, 7, 3, 9, 8, 4] left
1
[1, 2, 5, 6, 7, 3, 9, 8, 4]
5 2 8
[1, 2, 5, 6, 7, 3, 9, 8, 4]
[1, 2, 4, 6, 7, 3, 9, 8, 4] right
[1, 2, 4, 6, 7, 3, 9, 8, 6] left
[1, 2, 4, 3, 7, 3, 9, 8, 6] right
[1, 2, 4, 3, 7, 7, 9, 8, 6] left
[1, 2, 4, 3, 7, 7, 9, 8, 6] right
[1, 2, 4, 3, 7, 7, 9, 8, 6] left
4
[1, 2, 4, 3, 5, 7, 9, 8, 6]
4 2 3
[1, 2, 4, 3, 5, 7, 9, 8, 6]
[1, 2, 3, 3, 5, 7, 9, 8, 6] right
[1, 2, 3, 3, 5, 7, 9, 8, 6] left
3
[1, 2, 3, 4, 5, 7, 9, 8, 6]
7 5 8
[1, 2, 3, 4, 5, 7, 9, 8, 6]
[1, 2, 3, 4, 5, 6, 9, 8, 6] right
[1, 2, 3, 4, 5, 6, 9, 8, 9] left
[1, 2, 3, 4, 5, 6, 9, 8, 9] right
[1, 2, 3, 4, 5, 6, 9, 8, 9] left
6
[1, 2, 3, 4, 5, 6, 7, 8, 9]
8 7 8
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9] right
[1, 2, 3, 4, 5, 6, 7, 8, 9] left
7
[1, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
进程已结束,退出代码0
快速排序的递归控制的是排序的范围,p左侧右侧都完成排序,列表自然完成排序。
快速排序的时间复杂度是O(nlogn)
快速排序的两个问题:
递归会占用相当部分的内存
有最坏情况的发生,在本例中如源列表是倒序的情况,时间复杂度为O(n^2)