python3 -- 快速排序2

import numpy as np


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]
        # print('right',array)
        while left < right and array[left] <= key:
            left += 1
        array[right] = array[left]
        # print('left',array)
    array[right] = key
    quick_sort(array, low, left - 1)
    quick_sort(array, left + 1, high)

    print(array)


if __name__ == "__main__":
    for _ in range(1):
        arr = np.random.randint(0, 100, size=[10])
        print(arr)
        sorted_arr = np.sort(arr)
        quick_sort(arr, 0, np.size(arr) - 1)
        assert (sorted_arr.all() == arr.all())
        print("aaa")