关于冒泡排序Bubble Sorting in JS

// bubble sort algorithm in JavaScript
const fooBubbleSort = (arr) => {
    let len = arr.length;
    // defined for the swapped
    let swapped;
    // do....while
    do {
        swapped = false;
        // for loop
        for (let i=0; i<len; i++) {
            // if statement, swap
            if (arr[i] < arr[i+1]) {
                [arr[i], arr[i+1]] = [arr[i+1], arr[i]];
                swapped = true;
            }
        }
    } while(swaped);
    return arr;
}
let arr = [32, 2, 21, 78, 1, 255, 98, 76];
console.log(fooBubbleSort(arr));

// bubble sort algorithm in JavaScript
const fooBubbleSort = (arr) => {
    let len = arr.length;
    // for loop
    for (let i=0; i<len; i++) {
        for (let j=0; j<len; j++) {
            // if statement
            if (arr[i] < arr[i+1]) {
                [arr[i], arr[i+1]] = [arr[i+1], arr[i]];
            }
        }
    }
    return arr;
}
let arr = [32, 2, 21, 78, 1, 255, 98, 76];
console.log(fooBubbleSort(arr));