实现快速排序很棘手，但是如果您理解并继续练习，它将变得更容易。

const QuickSort =（arr，lo，hi）=> { 如果（lo> = hi）{ 返回 ; } const pivotIndex = get -pivotIndex（arr，lo，hi）; QuickSort（arr，lo，pivotindex-1）; QuickSort（ARR，PivotIndex 1，HI）; } const getPivotIndex =（arr，lo，hi）=> { const pivot = arr [hi]; 令IDX = LO-1; （让i = lo; i

const quickSort = (arr, lo, hi) => {
    if (lo >= hi) {
        return ;
    }

    const pivotIndex = getPivotIndex(arr, lo, hi);
    quickSort(arr, lo, pivotIndex-1);
    quickSort(arr, pivotIndex 1, hi);
}

const getPivotIndex = (arr, lo, hi) => {
    const pivot = arr[hi];
    let idx = lo-1;

    for (let i = lo; i