bubbleSort implementation

bubbleSort.js

const defaultCompare = (a, b) => a < b;

const swapArrayItem = (arr, i, j) => {
    let tmp = arr[i];
    arr[i] = arr[j];
    arr[j] = tmp;
};

const bubbleSort = (arr, compare = defaultCompare) => {
    let len = arr.length;
    let swapped;
    do {
        swapped = false;
        for (let i = 0; i < len - 1; i++) {
            if (!compare(arr[i], arr[i + 1])) {
                swapArrayItem(arr, i, i + 1)
                swapped = true;
            }
        }
        len -= 1;
    } while (swapped)
    return arr;
}