最近开始学习数据结构。

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

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

//sort排序

vartestArr1=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

vartestArr2=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

vartestArr3=[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){returna>b});//排序结果：[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]

testArr3.sort(function(a,b){returna-b});//排序结果：[2,3,4,5,15,19,26,27,36,38,44,46,47,48,50]

//Bubble排序

vartestArr1=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

vartestArr2=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

functionbubbleSort1(array){

for(i=array.length-1;i>0;i--){

for(j=0;j<i;j++){

if(array[j+1]<array[j]){

vartemp=array[j+1];

array[j+1]=array[j];

array[j]=temp;

}

}

}

}

functionbubbleSort2(array){

for(i=array.length-1;i>0;i--){

for(j=0;j<i;j++){

if((array[j+1]-array[j])<0){

vartemp=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排序

vartestArr=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

functionselectSort(array){

for(i=0;i<array.length;i++){

varslc=array[i];//初始时设未排序的第一个值为选中值

varslcIdx;//记录一次循环后作为选中值的index

for(j=i;j<array.length;j++){

if(array[j]<slc){

slc=array[j];

slcIdx=j;

}

}

if(slc!=test[i]){//如果最后作为选中值的值和初始slc值不相等

vartemp=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排序

vartestArr=[3,44,38,5,47,15,36,26,27,2,46,4,19,50,48];

functioninsertSort(array){

for(vari=0;i<array.length-1;i++){//注意i小于数组的长度-1，否则会造成数组越界，形成死循环

varcurElement=array[i+1];

for(varj=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]

以上就是本文在的内容，希望对大家有所帮助