冒泡排序法

//冒泡排序
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];
num[j] = tmp;
}
}
console.log("第"+(i+1)+"次" + num)
}
console.log(num);//最后的数组