quickSort.js

function sort(nums)
{
    if (!nums.length) return nums;
  
    var a = [], b = [], p = nums[0];
  
    for (var i = 1; i < nums.length; i++)
    {
      if (nums[i] < p)
        a[a.length] = nums[i];
      else 
        b[b.length] = nums[i];
    }

    return sort(a).concat(p, sort(b));
}

var some = [128, 55, 44, 11, 22, 33, 256];

console.log(sort(some));