排序_快排算法

def partition(arr,low,high):
     
    i=low-1
    pivot =arr[high]
    print(arr[low:high],pivot)
    for j in range(low,high):
        if arr[j]<pivot :
            i+=1
            arr[i],arr[j]=arr[j],arr[i]
    arr[i+1],arr[high]=arr[high],arr[i+1]
   
    return i+1

def quickSort(arr,low,high):
    if low<high:
        pi=partition(arr,low,high)
        quickSort(arr,low,pi-1)
        quickSort(arr,pi+1,high)

quickSort(a,0,len(a)-1)