Bubble Sort Visualizer

Bubble Sort Algorithm

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements 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.

Time Complexity:

• Worst-case: $O(n^2)$
• Average-case: $O(n^2)$
• Best-case: $O(n)$ (when the array is already sorted)

Space Complexity: $O(1)$

Pseudocode:

function bubbleSort(array):
    n = length(array)
    for i from 0 to n-1:
        swapped = false
        for j from 0 to n-i-1:
            if array[j] > array[j+1]:
                swap(array[j], array[j+1])
                swapped = true
        if not swapped:
            break // If no two elements were swapped by inner loop, then break