冒泡排序法

//冒泡排序 var num = [30,22,8,11,7]; var tmp = []; for(var i = 0;i <= num.length-1;i++){ for(var j = 0;j<=num.length -1 -i;j++ ){ if(num[j] > num[j+1]){ tmp = num[j + 1]; num[j+1] = num [j]; n

>>阅读原文<<