javascript-实现冒泡排序算法

function bubbleSort(target) {
    for (let i = 0; i < target.length - 1; i++) {
        for (let j = 0; j < target.length - i; j++) {
            if (target[j] > target[j + 1]) {
                [target[j], target[j + 1]] = [target[j + 1], target[j]];
            }
        }
    }
    return target
}

const arr = [1, 3, 7, 2, 5]
console.log(bubbleSort(arr)) // [ 1, 2, 3, 5, 7 ]