数组去重 && 快速排序

Posted 2021-11-04 smile-fanyin

　var arr0 = [1,3,3,3,4,4,4,4,5,5];

var arr1 = [10,9,2,5,7,34,65,48,90,103];
        var newArr=[];
       /*  for(var i=0;i<arr.length;i++){
            newArr.indexOf(arr[i])<0 && (newArr.push(arr[i]));
        } */
        // newArr = Array.from(new Set(arr));

        // 快速排序
        function quikSort(arr){
            if(arr.length<=1)return arr;
            var midIndex = Math.floor(arr.length/2);
            var midVal = arr.splice(midIndex,1)[0];

            var leftArr = [];
            var rightArr = [];
            for (var val of arr){
               if(val<midVal){leftArr.push(val)}else{rightArr.push(val)}
            }
            /* for(var k=0;k<arr.length;k++){
                if( arr[k]<midVal ){
                    leftArr.push(arr[k])
                }else{
                    rightArr.push(arr[k])
                }
            } */
            return quikSort(leftArr).concat(midVal,quikSort(rightArr));
        }
        console.log( quikSort(arr1) );