js冒泡排序法-(从大到小排序，从小到大排序)

// 冒泡排序法-从大到小排序
let itemSort = [8, 1, 4, 7, 3, 2, 9];
for (let i = 0; i < itemSort.length; i++) {
    for (let y = i; y > 0; y--) {
        if (itemSort[y] > itemSort[y - 1]) {
            [itemSort[y - 1], itemSort[y]] = [itemSort[y], itemSort[y - 1]]
        }
    }
}

// 冒泡排序法-从小到大排序
let itemSort = [8, 1, 4, 7, 3, 2, 9];
for (let i = 0; i < itemSort.length; i++) {
    for (let y = i; y > 0; y--) {
        if (itemSort[y] < itemSort[y - 1]) {
            [itemSort[y - 1], itemSort[y]] = [itemSort[y], itemSort[y - 1]]
        }
    }
}
console.log(itemSort)