前端算法总结

//快排
function QuickSort(arr,left,right) {
        if(left>=right){
            return;
        }
        var pivot_index = Partion(arr,left,right);
        QuickSort(arr,left,pivot_index-1);
        QuickSort(arr,pivot_index+1,right);
        function Partion(arr, left, right) {
            var pivot = arr[right];
            var tail = left - 1;
            for (var i=left;i

待续