快速排序

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