Simple QuickSort in JS

quickSort.js

function quickSort (arr) {
  if (!arr.length)
    return arr

  var pivot = arr.splice(0, 1)
  var less = []
  var greater = []

  arr.forEach(function (el) {
    if (el <= pivot)
      less.push(el)
    else
      greater.push(el)
  })
  
  return quickSort(less).concat(pivot, quickSort(greater))
}

var test = [ 1, 7, 3, 6, 8, 9, 10, 45, 23, 54, 4, 3 ]

var sorted = quickSort(test)

console.log('sorted', sorted)

Thanks for your kind words @DennyDaVjncj! :D

why did you splice arr, instead of taking random pivot index?

Great question @zero-t4, I'm curious about that too

your code is my study material in 2023