Quick sort javascript

gistfile1.js

// A swap function
var swap = function(array,i,j){
  var aux = array[i];
  array[i] = array[j];
  array[j] = aux;
};

// Quick sort implementation
var quickSort = function(array) {
    var f = function(from,to){
        if(to-from<=2){
            return;
        }
        var pivot = from;
        var socket = from+1;
        for(var i = from+1; i < to; i++){
            if(+array[pivot]>+array[i]){
                swap(array,socket,i);
                socket++;
            }
        }
        swap(array,pivot,socket-1);
        pivot = socket;
        // recursivelly sort left and right of the pivot
        f(from,pivot);
        f(pivot,to);
    };

    f(0,array.length);
    return array;
};