quickSort.js

// Find a "pivot" element in the array to compare all other
// elements against and then shift elements before or after
// pivot depending on their values
const qucikSort = (arr, left = 0, right = arr.length - 1) => {
    if (arr.length > 1) {
        const index = partition(arr, left, right)
        if (left < index - 1) {
            qucikSort(arr, left, index - 1)
        }
        if (index < right) {
            qucikSort(arr, index, right)
        }
    }
    return arr

}
const partition = (arr, l, r) => {
    let pivot = arr[Math.floor((r + l) / 2)],
        left = l,                 // Start pointer at the first item in the array
        right = r                 // Start pointer at the last item in the array
    while (left <= right) {
        // Move left pointer to the right until the value at the
        // left is greater than the pivot value
        while (arr[left] < pivot) {
            left++
        }
        // Move right pointer to the left until the value at the
        // right is less than the pivot value
        while (arr[right] > pivot) {
            right--
        }
        // If the left pointer is less than or equal to the 
        // right pointer, then swap values
        if (left <= right) {
            [arr[left], arr[right]] = [arr[right], arr[left]]  // ES6 destructuring swap
            left++
            right--
        }
    }
    return left
}

// console.log(qucikSort([32,3,0,-1,2,3,54,7,32,3,0,-1,2,3,54,7,888,2,-22,-999]))