Skip to content
本页目录

冒泡排序

基础版

JS
let arr = [23, 72, 53, -9, 3, 7, 11, 172]

function bubbleSort(arr) {
    const len = arr.length

    for (var i = 0; i < len; i++) {
        for (var j = 0; j < len; j++) {
            if (arr[j] > arr[j+1]) {
                let c = arr[j]
                arr[j] = arr[j+1]
                arr[j+1] = c
                // [arr[j+1], arr[j]] = [arr[j], arr[j+1]]
            }
        }
    }

    return arr
}

bubbleSort(arr)
let arr = [23, 72, 53, -9, 3, 7, 11, 172]

function bubbleSort(arr) {
    const len = arr.length

    for (var i = 0; i < len; i++) {
        for (var j = 0; j < len; j++) {
            if (arr[j] > arr[j+1]) {
                let c = arr[j]
                arr[j] = arr[j+1]
                arr[j+1] = c
                // [arr[j+1], arr[j]] = [arr[j], arr[j+1]]
            }
        }
    }

    return arr
}

bubbleSort(arr)

优化版

JS