quickSort.js

quickSort = (array) => {
  if (array.length < 2) {
    return array
  }
  const chosenIndex = array.length - 1
  const chosen = array[chosenIndex]
  const a = []
  const b = []
  for (let i = 0; i < chosenIndex; i++) {
    const temp = array[i]
    temp < chosen ? a.push(temp) : b.push(temp)
  }

  const output = [...quickSort(a), chosen, ...quickSort(b)]
  console.log(output.join(' '))
  return output
}