← All examples

Bubble sort

JavaScript Algorithms

nested loops + swap

Flowchart (ISO 5807)

YesNoStartInput ai = 0, a.length - 1, 1j = 0, a.length - i - 1 - 1, 1a[j] > a[j + 1][a[j], a[j + 1]] = [a[j + 1], a[j]]Return aEndFigure 1 — bubbleSort

Source code

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