1.常用的数组自带的方法
var arr
= [6, 3, 8, 7, 1, 5, 4, 2, 9];
arr
.sort(function(a
, b
){
return a
- b
;
});
console
.log(arr
);
2.冒泡排序
var arr
= [6, 3, 8, 7, 1, 5, 4, 2, 9];
var t
;
for (var i
= 0; i
< arr
.length
- 1; i
++) {
for (var j
= 0; j
< arr
.length
- 1 - i
; j
++) {
if (arr
[j
] > arr
[j
+ 1]) {
t
= arr
[j
];
arr
[j
] = arr
[j
+ 1];
arr
[j
+ 1] = t
;
}
}
}
console
.log(arr
);
转载请注明原文地址: https://lol.8miu.com/read-9158.html