A23982. 下述python代码实现了快速排序算法，下面说法错误的是（ ）。def partition(arr, low, high): i, j = low, high while i < j: while i < j and arr[j] >= arr[low]: j -= 1 while i < j and arr[i] <= arr[low]: i += 1 arr[i], arr[j] = arr…

下述python代码实现了快速排序算法，下面说法错误的是（    ）。

def partition(arr, low, high):
    i, j = low, high
    while i < j:
        while i < j and arr[j] >= arr[low]:
            j -= 1
        while i < j and arr[i] <= arr[low]:
            i += 1
        arr[i], arr[j] = arr[j], arr[i]
    arr[i], arr[low] = arr[low], arr[i]
    return i

def quickSort(arr, low, high):
    if low < high:
        pivot = partition(arr, low, high)
        quickSort(arr, low, pivot - 1)
        quickSort(arr, pivot + 1, high)