JS排序算法之选择排序

 1 function swap (k,y,arr) {
 2     var aux = arr[k];
 3     arr[k] = arr[y];
 4     arr[y]=aux;
 5         
 6 };
 7 
 8 
 9 var group= [1,9,3,5,0,4];
10 
11 function selectSort(list) {
12     for (var i=0;i<list.length-1;i++){
13         var selected = i;
14         for (var j=i;j<list.length;j++){
15             if(list[j]<list[selected]){
16                 selected =j;
17             }
18             
19         }
20         if(list[i]>list[selected]){
21             swap(i,selected,list);
22         }    
23     }
24 return list;
25 }
26 
27 selectSort(group);