快速排序-完整实现

def quick_sort(____):
    def helper(____):
        if low < high:
            pi = partition(____)
            helper(____)
            helper(____)
    
    def partition(____):
        pivot = arr[high]
        i = low - ____
        for j in range(____):
            if arr[j] <= pivot:
                i += ____
                arr[i], arr[j] = arr[j], arr[i]
        arr[i + ____], arr[high] = arr[high], arr[i + ____]
        return i + ____
    
    arr = arr.copy()
    helper(arr, ____, len(____) - ____)
    return arr