快速排序

def solve():
    def quickSort(____):
        if left >= right:
            return
        pivot = nums[(____) // ____]
        i, j = left, right
        while i <= j:
            while nums[i] < pivot:
                i += ____
            while nums[j] > pivot:
                j -= ____
            if i <= j:
                nums[i], nums[j] = nums[j], nums[i]
                i += ____
                j -= ____
        quickSort(____)
        quickSort(____)
    nums = [____, ____, ____, ____]
    quickSort(nums, ____, len(____)-____)
    print(____)