快速排序--python

import random


def quick_sort(nums, start, end):
    if start >= end:
        return
    low = start
    mid = nums[low]
    high = end
    while low < high:
        while low < high and mid <= nums[high]:
            high -= 1
        nums[low] = nums[high]
        while low < high and mid > nums[low]:
            low += 1
        nums[high] = nums[low]
    nums[low] = mid
    quick_sort(nums, start, low - 1)
    quick_sort(nums, low + 1, end)


def test_arr(count, limit):
    arr = []
    for i in range(count):
        arr.append(random.randint(1, limit))
    return arr


if __name__ == '__main__':
    arr = test_arr(10, 100)
    print('快速排序前:')
    print(arr)
    quick_sort(arr, 0, len(arr) - 1)
    print('快速排序后:')
    print(arr)