Lomuto's quick sort

quickSort.js

const quickSort = (arr, low = 0, high = arr.length - 1) => {
  if (low < high) {
    const p = partition(arr, low, high)
    quickSort(arr, low, p - 1)
    quickSort(arr, p + 1, high)
  }
}

const partition = (arr, low, high) => {
  const pivot = arr[high]
  let i = low
  for (let j = low; j <= high; j++) {
    if (arr[j] < pivot) {
      ;[arr[i], arr[j]] = [arr[j], arr[i]]
      i++
    }
  }
  ;[arr[i], arr[high]] = [arr[high], arr[i]]
  return i
}