python快速排序代碼示例！

def Partition(array, low, high):
    key = array[low]
    while low < high:
        while low < high and array[high] >= key:
            high = high - 1
        while low < high and array[high] < key:
            array[low] = array[high]
            low += 1
            array[high] = array[low]

    array[low] = key
    return low

def Quick_Sort(array, low, high):
    if low < high:
        mid = Partition(array, low, high)
        Quick_Sort(array, low, mid)
        Quick_Sort(array, mid+1, high)

if __name__ == '__main__':
    array = [3,5,2,4,1,9,7,8,6,10]
    print(array)
    Quick_Sort(array, 0, len(array)-1)
    print(array)

感覺和C++寫法基本一樣，不需要太多操作。