Interview question: javascript implement bubble sort

bubbleSort.js

/**
 * From: https://leetcode.com/problems/sort-an-array/
 * Question: bubble sort
 * @param nums
 * @returns {*}
 */
var sortArray = (nums) => {
    var swap = (i, j) => {
        var tmp = nums[i]
        nums[i] = nums[j]
        nums[j] = tmp
    }
    for (var i = nums.length - 1; i >= 0; i--) {
        var sorted = true
        for (var j = 0; j < i; j++) {
            if (nums[j] > nums[j + 1]) {
                swap(j, j + 1)
                sorted = false
            }
        }
        if (sorted) {
            break
        }
    }
    return nums
}
var {assertSort} = require("./sortHelper")
var asrSort = (nums) => {
    assertSort(sortArray, nums)
}
describe("bubbleSort", () => {
    it("1", () => {
        asrSort([3, 2, 1])
    })
})

If you like my article, donate me a coffee and let me continue

Donate

Donate backup