快速排序

def solve():
    def quick_sort(____):
        if len(____) <= ____:
            return arr
        pivot = arr[len(____) // ____]
        left = [x for x in arr if x < pivot]
        middle = [x for x in arr if x == pivot]
        right = [x for x in arr if x > pivot]
        return quick_sort(____) + middle + quick_sort(____)
    
    nums = [____, ____, ____, ____, ____, ____, ____]
    print(quick_sort(____))