Quick Sort

Quick Sort algorithm

function swap( a, b){
    var sw=[];
    sw[0]=b;
    sw[1]=a;
    return sw;
}

function wall(arr, first, last){
    var wallElement= arr[last];
    var i=first-1;
    for (var j=first; j<=last-1; j++)
    {
        if(arr[j]