Quick Sort algorithm

quickSort.js

const quickSort = (array) => {
  if (array.length < 2) {
    return array
  }

  const pivot = array[0]
  const arrayWithoutPivot = array.slice(1)
  const less = arrayWithoutPivot.filter((n) => n < pivot)
  const greater = arrayWithoutPivot.filter((n) => n > pivot)

  return [...quickSort(less), pivot, ...quickSort(greater)]
}