js关于数组简易排序的一些写法(持续更新)

js关于数组简易排序的一些写法：

  1：快速排序

  

function fastSort(a){
if(a.length<=1){return a};

    var num = Math.floor(a.length / 2);
	//var num=parseInt(a.length/2);
　　var reference = a[num-1];	
    var referenceLeft=[];
    var referenceRight=[];


for(var i=0;i<a.length;i++){	
	if(i==(num-1)){continue}
	if(a[i]<reference){
     referenceLeft.push(a[i]);
	}else{
     referenceRight.push(a[i]);
	}
 }
return fastSort(referenceLeft).concat([reference],fastSort(referenceRight));
}
	
var arrayA=[2,4,65,7,434,89,33,998,43,234,556,6,4,7];
	
	console.log(fastSort(arrayA))

2:数组去重

 function detection(a){
  var temp=[];

  for(var i=0;i<a.length;i++){
     var flag=true;
     for(var j=0;j<temp.length;j++){
       if(a[i]==temp[j]){
          flag=false;
          break;
       }
     }
     if(flag==true){
       temp.push(a[i]);
     }
  }
    return temp;

 }

3 去重加快速排序

 function fastSortDetection(a){
   if(a.length<=1){return a};

    var num = Math.floor(a.length / 2);
	//var num=parseInt(a.length/2);
　　var reference = a[num-1];	
    var referenceLeft=[];
    var referenceRight=[];


   for(var i=0;i<a.length;i++){	
	if(i==(num-1)){continue}
	if(a[i]<reference){
     referenceLeft.push(a[i]);
	}else if(a[i]>reference){
     referenceRight.push(a[i]);
	}
   }
   return fastSort(referenceLeft).concat([reference],fastSort(referenceRight));
 }

 4 非递归实现快速排序及去重

function fastSortDetection(a){
   var ary=[];
   var temp=[];

        var referenceRight=[];
        var referenceLeft=[];
        var num = Math.floor(a.length / 2);

        for(var i=0;i<num;i++){
          if(a[i]<a[num]){
            referenceLeft.push(a[i]);            
          }else if(a[i]>a[num]){
            referenceRight.push(a[i]);  
          }
        }

        for(var i=num;i<a.length;i++){
          if(a[i]<a[num]){
            referenceLeft.push(a[i]);            
          }else if(a[i]>a[num]){
            referenceRight.push(a[i]);  
          }
        }
      temp.push(referenceLeft,[a[num]],referenceRight);
      
      while(temp.length>0){
       var aryLeft=temp.shift();
       if(aryLeft.length==1){
         ary.push(aryLeft[0]);
       }else if(aryLeft.length>1){
         referenceRight=[];
         referenceLeft=[];
         num = Math.floor(aryLeft.length / 2);

        for(var i=0;i<num;i++){
          if(aryLeft[i]<aryLeft[num]){
            referenceLeft.push(aryLeft[i]);            
          }else if(aryLeft[i]>aryLeft[num]){
            referenceRight.push(aryLeft[i]);  
          }
        }

        for(var i=num;i<aryLeft.length;i++){
          if(aryLeft[i]<aryLeft[num]){
            referenceLeft.push(aryLeft[i]);            
          }else if(aryLeft[i]>aryLeft[num]){
            referenceRight.push(aryLeft[i]);  
          }
        }
        temp.unshift(referenceLeft,[aryLeft[num]],referenceRight)
       }
     
     }
    return ary;

 }

 

转载于:https://my.oschina.net/u/3071114/blog/796559