冒泡排序基础原理
var arr = [10, 5, 8, 16, 32, 11]
let len = arr.length
var temp
for (let i = 0; i <= len - 1; i++) {
for (let j = 0; j < len - i - 1; j++) {
if (arr[j] < arr[j + 1]) {
temp = arr[j]
arr[j] = arr[j + 1]
arr[j + 1] = temp
}
}
}
console.log(arr)