Bubble Sort .comparison

Simplest exchange sort using adjacent physical swaps

Speed: 500ms

Scanning

Swapping

Sorted Locked

Comparing bounds

—

Total Swaps

Items Sorted

0 / 0

Step: 1 / 0

0% Complete

BUBBLE_SORT.JS

function bubbleSort(array) {
    let n = array.length;
    for (let i = 0; i < n - 1; i++) {
        let swapped = false;
        for (let j = 0; j < n - i - 1; j++) {
            // Compare adjacent elements
            if (array[j] > array[j + 1]) {
                // Swap them if out of order
                let temp = array[j];
                array[j] = array[j + 1];
                array[j + 1] = temp;
                swapped = true;
            }
        }
        // Array fully sorted if no swaps occurred
        if (!swapped) break;
    }
    return array;
}

Complexity AnalysisO(N²)

Time: O(N²)Space: O(1)

Pro Tip

Bubble sort guarantees that the largest unsorted element "bubbles up" to its correct position at the end of each pass. That's why the tail naturally becomes locked and sorted first!

Algorithm Status

Initializing bubble sort...