JavaScript sorting algorithm

sort.js

const arr = [16, 31, 12, 1, 9, 23, 10]

// bubble sort
function bubble (arr) {
  for (let i = 0; i < arr.length - 1; i++) {
    for (let j = 0; j < arr.length - i - 1; j++) {
      if (arr[j] > arr[j+1])
        [ arr[j], arr[j+1] ] = [ arr[j+1], arr[j] ]
    }
  }
  return arr
}

console.log(`Bubble sort: ${bubble(arr)}`)

// quick sort
function quick (arr) {
  if (arr.length <= 1) return arr
  const middleIndex = Math.floor(arr.length / 2)
  const middle = arr.splice(middleIndex, 1)

  const left = []
  const right = []

  arr.forEach(v => {
    if (v < middle[0]) left.push(v)
    else right.push(v)
  })

  return quick(left).concat(middle, quick(right))
}

console.log(`Quick sort: ${quick(arr)}`)