使用python实现快速排序

def quick_sort(a, lo, hi):
    if lo >= hi:
        return
    j = quick_partition(a, lo, hi)
    quick_sort(a, lo, j - 1)
    quick_sort(a, j + 1, hi)


# [10, 20, 10, 3, 10, 20, 7]
def quick_partition(a, lo, hi):
    mid_value = a[lo]
    # 左右扫描指针
    i = lo + 1
    j = hi
    while True:
        # 扫描左边
        while a[i] <= mid_value and i < hi:
            i += 1
        # 扫描右边
        while a[j] >= mid_value and j > lo:
            j -= 1

        if i >= j:
            break
        a[i], a[j] = a[j], a[i]

    a[lo], a[j] = a[j], a[lo]

    return j


if __name__ == "__main__":
    a = [10, 10, 4, 3, 10, 4, 3, 10, 10, 4, 3, 10, 4]
    print(a)
    print(len(a))
    quick_sort(a, 0, len(a) - 1)
    print(a)