var arr = [18,23,53,67,21,45,65,21,45];
function sort(myArr){
for(var i = 0; i<myArr.length; i++){
for(var j = 0; j<myArr.length-1; j++){
if(myArr[j] > myArr[j+1]){ //大于号是由小到大,小于号是由大到小;
var value = myArr[j];
myArr[j] = myArr[j+1];
myArr[j+1] = value;
}
}
}
return myArr;
}
function sort2(myArr){
for(var i = 0; i<myArr.length; i++){
for(var j = 0; j<myArr.length-1; j++){
if(myArr[j] < myArr[j+1]){ //大于号是由小到大,小于号是由大到小;
var value = myArr[j];
myArr[j] = myArr[j+1];
myArr[j+1] = value;
}
}
}
return myArr;
}
console.log(sort(arr));
//上面的方法会改变原数组,这样我们就需要添加一个方法,先克隆一下数组,再处理
Array.prototype.cloneArr = function(){
var a = [];
for(var i = 0; i<this.length; i++){
a[i] = this[i];
}
return a;
}
console.log(sort2(arr.cloneArr()));
js 冒泡排序法
最新推荐文章于 2024-07-24 20:02:07 发布