快速排序算法Python实现教程

def sub_sort(arr,low,high):
    key=arr[low]
    while lowwhile lowand arr[high]>=key:
            high-=1
        arr[low]=arr[high]
        while lowand arr[low]<=key:
            low+=1
        arr[high]=arr[low]
    arr[low]=key
    return low

def quick_sort(arr,low,high):
    if lowif __name__=='__main__':
    arr=[8,7,6,0,8,9,12,45,78,23,45,67]
    print(arr)
    quick_sort(arr, 0, len(arr)-1)
    print(arr)