【算法】排序：快速排序

def quick_sort(list, left, right):
    if left >= right:
        return

    low = left
    high = right
    p = list[left]

    while left<right:
        while (left<right) and (list[right] >= p):
            right = right-1
        list[left] = list[right]
        while (left<right) and (list[left] < p):
            left = left+1
        list[right] = list[left]

    list[left] = p

    quick_sort(list, low, left-1)
    quick_sort(list, left+1, high)



if __name__ == '__main__':
    list_target = [2, 3, 1, 7, 5, 7, 9, 0, 9]

    quick_sort(list_target, 0, len(list_target)-1)
    print(list_target)