快速排序——python

def partition(li, left, right):
    temp = li[left]
    while left < right:
        while left < right and temp <= li[right]:
            right -= 1
        li[left] = li[right]
        while left < right and temp >= li[left]:
            left += 1
        li[right] = li[left]
    li[left] = temp
    return left


def quick_sort(li, left, right):
    if left < right:
        mid = partition(li, left, right)
        quick_sort(li, left, mid - 1)
        quick_sort(li, mid + 1, right)


li = [5, 6, 2, 3, 8, 9, 4, 1, 7]
quick_sort(li, 0, len(li) - 1)
print(li)