冒泡排序
时间复杂度:O(N²)
从小到大
const arr = [1,4,3,6,7,5,2,9,8,2,6,7,0,8,6]
for(let i = 0; i < arr.length; i++) {
for(let j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j+1]) {
arr[j] =[arr[j+1],arr[j+1]=arr[j]][0]
}
}
}
console.log(arr)// [0, 1, 2, 2, 3, 4, 5, 6, 6, 6, 7, 7, 8, 8, 9]
从大到小
const arr = [1,4,3,6,7,5,2,9,8,2,6,7,0,8,6]
for(let i = 0; i < arr.length; i++) {
for(let j = 0; j < arr.length - 1 - i; j++) {
// 只有判断条件改为小于 其它不变
if (arr[j] < arr[j+1]) {
arr[j] =[arr[j+1],arr[j+1]=arr[j]][0]
}
}
}
console.log(arr)// [9, 8, 8, 7, 7, 6, 6, 6, 5, 4, 3, 2, 2, 1, 0]