快速排序

def partition(start,end,array):
    pivot=array[start]
    left,right=start+1,end

    while True:

        while left<=right and  array[left]<=pivot:
            left+=1
        while left <=right and  pivot<=array[right]:
            right-=1
        if left<=right:
            print(left,right,pivot,array[left],array[right])
            array[left],array[right]=array[right],array[left]
        else:
            break
    array[start],array[right] = array[right],array[start]

    return right

def quick_sort(array,start,end):
    if start>=end: return

    p = partition(start,end,array)
    quick_sort(array,start,p-1)
    quick_sort(array,p+1,end)

array = [29,99,27,41,66,28,44,78,87,19,31,76,58,88,83,97,12,21,44]
quick_sort(array,0,len(array)-1)
print(array)