快速排序时间复杂度平均O(nlgn),最坏的话是O(n^2),原址排序,是不稳定的排序算法
过程可以描述为两步:
1.分解,将A[p...r]分解为A[p...q-1]和A[q+1...r],前者每个元素均小于A[q],后者每个元素均大于A[q]
2.通过递归对A[p...q-1]和A[q+1...r]进行排序
python实现如下:
def quick_sort(A, first, last):
if first < last:
q = partition(A, first, last)
quick_sort(A, first, q-1)
quick_sort(A, q+1, last)
def partition(A, first, last):
i = first - 1
x = A[last]
for j in range(first, last):
if A[j] <= x:
i += 1
A[i], A[j] = A[j], A[i]
A[i+1], A[last] = A[last], A[i+1]
return i+1
if __name__ == "__main__":
list = [13,19,9,5,12,11,8,7,4,21,11,2,6,11]
print(list)
quick_sort(list, 0, len(list)-1)
print(list)
课后思考题7.2有关于重复元素的处理,希望在分解时可以返回两个下标, q和t,使得A[p...q-1]都是小于A[q],A[q+1...t]都等于A[q],A[t+1..r]都大于A[q]。
我的想法是,与快速排序类似,变化的一点在于:
遇上等于A[q]的元素,只移动t,交换t后面的元素和j的元素,当遇上小于A[q]的元素时,先交换A[j]和后移后的A[t],再移动i,将A[t]与A[i]交换,这么讲感觉讲不清楚ORZ。。。具体操作还是看代码清晰点
def quick_sort(A, first, last):
if first < last:
i,t = partition(A, first, last)
quick_sort(A, first, i-1)
quick_sort(A, t+1, last)
def partition(A, first, last):
i = first - 1
t = first - 1
x = A[last]
for j in range(first, last):
if A[j] < x:
t += 1
A[t], A[j] = A[j], A[t]
i += 1
A[i], A[t] = A[t], A[i]
elif A[j] == x:
t += 1
A[t], A[j] = A[j], A[t]
A[t+1], A[last] = A[last], A[t+1]
return i+1, t+1
if __name__ == "__main__":
list = [13,19,9,5,12,11,8,7,4,21,11,2,6,11]
print(list)
quick_sort(list, 0, len(list)-1)
print(list)