def quick_sort(array,left,right):
if left >= right:
return
low = left
high = right
key = array[low]
while left < right:
while left < right and array[right] > key:
right -= 1
array[left] = array[right]
while left < right and array[left] <= key:
left += 1
array[right] = array[left]
print(array)
array[right] = key
print(array)
quick_sort(array,low,left -1)
quick_sort(array,left + 1, high)
if __name__ == '__main__':
array = [2,3,4,1,6,2,4,6,7,1,0,96,3,56,53]
print(array)
quick_sort(array,0,14)
print(array)
对每一步执行的结果打印,清晰明了的知道运行的过程