快速排序实现

def partation(arr, left, right):
    pivot = arr[left]
    while left < right:
        while left < right and arr[right] >= pivot:
            right -= 1
        arr[left] = arr[right]
        while left < right and arr[left] <= pivot:
            left += 1
        arr[right] = arr[left]
    arr[left] = pivot
    return left
def quick_sort(arr, left, right):
    if left < right:
        index = partation(arr, left, right)
        quick_sort(arr, left, index -1)
        quick_sort(arr, index + 1, right)