JS排序方法（sort，bubble，select，insert）代码汇总

最近开始学习数据结构。

一点一点整理，希望能坚持下来。

因为方向是前端，所以用javascript实现。

//sort排序
var testarr1=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testarr2=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testarr3=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
testarr1.sort();//排序结果：[15, 19, 2, 26, 27, 3, 36, 38, 4, 44, 46, 47, 48, 5, 50]
testarr2.sort(function(a,b){return a>b});//排序结果：[2, 3, 4, 5, 15, 19, 26, 27, 36, 38, 44, 46, 47, 48, 50]
testarr3.sort(function(a,b){return a-b});//排序结果：[2, 3, 4, 5, 15, 19, 26, 27, 36, 38, 44, 46, 47, 48, 50]

//bubble排序

var testarr1=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
var testarr2=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function bubblesort1(array){
  for(i=array.length-1;i>0;i--){
    for(j=0;j<i;j++){
      if(array[j+1]<array[j]){
        var temp=array[j+1];
        array[j+1]=array[j];
        array[j]=temp;
      }
    }
  }
}
function bubblesort2(array){
  for(i=array.length-1;i>0;i--){
    for(j=0;j<i;j++){
      if((array[j+1]-array[j])<0){
        var temp=array[j+1];
        array[j+1]=array[j];
        array[j]=temp;
      }
    }
  }
}
bubblesort1(testarr1);//排序结果：[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]
bubblesort2(testarr2);//排序结果：[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]

//select排序

var testarr=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function selectsort(array){
  for(i=0;i<array.length;i++){
     var slc=array[i];//初始时设未排序的第一个值为选中值
     var slcidx;//记录一次循环后作为选中值的index
     for(j=i;j<array.length;j++){  
      if(array[j]<slc){
       slc=array[j];
       slcidx=j; 
      }
     }
   if(slc!=test[i]){//如果最后作为选中值的值和初始slc值不相等
    var temp=array[i];
    array[i]=array[slcidx];
    array[slcidx]=temp;
   }
  }
}
selectsort(testarr);//排序结果是：[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]

//insert排序

var testarr=[3, 44, 38, 5, 47, 15, 36, 26, 27, 2, 46, 4, 19, 50, 48];
function insertsort(array){
  for (var i = 0 ; i < array.length-1; i++) {//注意i小于数组的长度-1，否则会造成数组越界，形成死循环
    var curelement=array[i+1];
    for (var j = i; j >= 0; j--) {
      if(curelement<array[j]){
        array[j+1]=array[j];
        if(j==0){//当j==0时，说明已经排到了数组的最开头
          array[0]=curelement;
        }
      }else{
        array[j+1]=curelement;
         break;
      }
    };
  };
}
 insertsort(testarr);//排序结果是:[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]