Bubble Sort Demo

slow fast

From Wikipedia:
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

Complexity:
Worst-case: O(n²)
Best-case: O(n)
Average Performance: O(n²)

Implementation:
input: a as an array to be sorted
output: sorted array a

function bubbleSort(a){
    var swapped;
    do{
        swapped = false;
        for(var i=0; i < a.length-1; i++){
            if(a[i] > a[i+1]){
                var temp = a[i];
                a[i] = a[i+1];
                a[i+1] = temp;
                swapped = true;
            }
        }
    }while(swapped);
}

Bubble Sort Animation Demo