方法一：冒泡排序
var arr = [1,1,2,2,4,5,2,1,2];for (var i=0; i<arr.length; i++){for(var j=0; i<arr.length-i; j++){if(arr[j]>arr[j+1]){var a = arr[j];arr[j] = arr[j+1];arr...
方法一：冒泡排序
var arr = [1,1,2,2,4,5,2,1,2];
for (var i=0; i<arr.length; i++){
for(var j=0; i<arr.length-i; j++){
if(arr[j]>arr[j+1]){
var a = arr[j];
arr[j] = arr[j+1];
arr[j+1] = a;
}
}
}
方法二：借用数组排序方法sort();
var arr = [1,1,2,2,4,5,2,1,2];
function paixu(a,b){
return a-b;
}
arr.sort(paixu);
console.log(arr); //输出结果
