算法题---快速排序

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

    low = left
    high = right
    key = array[low]

    while left < right:
        while left < right and array[right] > key:
            right -= 1
        array[left] = array[right]
        while left < right and array[left] < key:
            left += 1
        array[right] = array[left]
    array[left] = key
    quick_sort(array, low, left - 1)
    quick_sort(array, left + 1, high)
    return array