function partition(arr, low, high) {

    let lowIdx = low - 1;

    let pivot = arr[high];  // pivot

​

    for (let j = low; j < high; j++) {

        // If current element is smaller than or

        // equal to pivot

        if (arr[j] <= pivot) {

            // Increment index of left/smaller element

            lowIdx = lowIdx + 1;

            // Swap

            const temp = arr[lowIdx];

            arr[lowIdx] = arr[j];

            arr[j] = temp;

        }

    }

​

    const temp = arr[lowIdx + 1];

    arr[lowIdx + 1] = arr[high];

    arr[high] = temp;

​

    return lowIdx + 1

}

​

function quickSort(arr, low, high) {

    if (arr.length === 1) {

        // Base case

        return arr;

    }