JavaScript Quick Sort

If you write a sort, how would you write it? is the For loop done? Let's see how this is achieved:

functionQuickSort (arr) {if(arr.length<=1){            returnarr; }        varnum = Math.floor (ARR/2);varNumValue = Arr.splice (num,1); varleft=[]; varright=[];  for(vari=0;i<arr.length;i++){            if(arr[i]<NumValue)            {Left.push (arr[i]); }Else{Right.push (arr[i]); }        }        returnArguments.callee (left). Concat ([Numvalue],arguments.callee (right))}

View Code

Overall thought: Cut → queued, so recursive

Before touching this algorithm is a bit of a mask, will certainly think of writing two for the loop comparison, but, two for loop, the overall number of operations is definitely greater than the top of this sort

JavaScript Quick Sort