SOURCE

// 实现冒泡排序 改进
const arr = [9, 1, 6, 5, 3]

const bubble = (arr) => {
    for(let i = 0; i < arr.length; i++){
        let switched = false
        for(let j = 0; j < arr.length - i; j++){
            console.log(arr, i, j)
            if(arr[j] > arr[j + 1]){
                let temp = arr[j]
                arr[j] = arr[j + 1]
                arr[j + 1] = temp
                switched = true
            }
        }
        if(!switched){  
            return arr
        }
    }
    return arr
}
console.log(bubble(arr))