NodeJ实现冒泡算法

function bubbleSort(array) {
    const n = array.length;
    for (let i = 0; i < n - 1; i++) {
        for (let j = 0; j < n - i - 1; j++) {
            if (array[j] > array[j + 1]) {
                // 交换array[j]和array[j+1]
                const temp = array[j];
                array[j] = array[j + 1];
                array[j + 1] = temp;
            }
        }
    }
}
const array = [64, 34, 25, 12, 22, 11, 90];
console.log("排序前数组：");
console.log(array.join(" "));
bubbleSort(array);
console.log("\n排序后数组：");
console.log(array.join(" "));