// 方法1.sort()
let array = [1,5,9,23,45,13,98,113,90];
function reorder1() {
return array.sort((a,b)=>a-b);
}
console.log(reorder1());
// 方法2 冒泡排序
function reorder2() {
let len = array.length;
for(let i = 0; i<len;i++) {
for(let j = 0; j < len-i; j++) {
if(array[j+1] > array[j]) {
let temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
return array.reverse();
}
console.log(reorder2());
