Quicksort using recursion

quicksort-recursion.js

function quicksort(list) {
  if (list.length < 2) {
    return list
  } else {
    let pivot = list[0]
    let restOfList = list.slice(1)
    let listGreaterThanPivot = []
    let listSmallerThanPivot = []

    for (let i = 0; i < restOfList.length; i++) {
      if (restOfList[i] > pivot) {
        listGreaterThanPivot.push(restOfList[i])
      } else {
        listSmallerThanPivot.push(restOfList[i])
      }
    }

    return quicksort(listSmallerThanPivot).concat([pivot], quicksort(listGreaterThanPivot));
  }
}

console.log('sort', quicksort([1, 15, 10, 33, 2]))