Javascript QuickSort

by stevenkaspar

JavaScript

let quickSort = arr => {
	if(arr.length < 1) return arr
  let less = [], more = []
  let pivot_index = Math.floor(arr.length / 2)
  let pivot = arr[pivot_index]
  for(let i = 0; i < arr.length; i++){
  	if(i === pivot_index) continue
  	if(arr[i] > pivot){
    	more.push(arr[i])
    }
    else {
    	less.push(arr[i])
    }
  }
  // console.log(less, more)
  less = quickSort(less)
  more = quickSort(more)
  let return_arr = [...less,...more]
  return_arr.splice(less.length, 0, pivot)
  return return_arr
}

console.log(quickSort([3,2,5,1,4,7,8,4,9]))