Python中快速排序算法

def quickSort(seq, start, end):
if start < end:
split = partition(seq, start, end)
quickSort(seq, start, split - 1)
quickSort(seq, split + 1, end)
return seq

def partition(seq, start, end):
pivot_index = start - 1
for i in range(start, end):
# 选择最右边的为pivot
if seq[i] < seq[end]:
pivot_index += 1
seq[pivot_index], seq[i] = seq[i], seq[pivot_index]
seq[end], seq[pivot_index + 1] = seq[pivot_index + 1], seq[end]
return pivot_index + 1

if name == “main”:

list1 = [10, 1, 3, 5, 7, 9, 2, 4, 6, 8, 11, 15, 0, 12, 14, 13]
end = len(list1)-1
print(quickSort(seq=list1, start=0, end=end))