Hoare's quicksort. More performant than Lomuto's.

quickSort.js

const quickSort = (arr, low = 0, high = arr.length - 1) => {
  if (low < high) {
    const p = partition(arr, low, high)
    quickSort(arr, low, p)
    quickSort(arr, p + 1, high)
  }
}
const partition = (arr, low, high) => {
  const pivot = arr[Math.floor((high + low) / 2)]
  let i = low
  let j = high
  while (true) {
    while (arr[i] < pivot) {
      i++
    }
    while (arr[j] > pivot) {
      j--
    }
    if (i >= j) {
      return j
    }
    ;[arr[i], arr[j]] = [arr[j], arr[i]]
  }
}