Quick Sort algorithm in JavaScript (with a relatively bigger memory complexity, for demonstration purpose only)

quicksort.js

var unsorted = [53,12,22,87,74,67,23,45,77,1,8,44];
function quickSort(arr){
  if(arr.length<2)
    return arr;
  var smaller = [];
  var larger = [];
  var pivot = arr[Math.floor(Math.random()*arr.length)];
  for(i=0;i<arr.length;i++){
  	if(arr[i]<=pivot)
      smaller.push(arr[i])
    else
      larger.push(arr[i])
  }
  return quickSort(smaller).concat(quickSort(larger))
}

console.log(quickSort(unsorted))