Bubble Sort

O(n²)

Colour Guide

Comparing These Two

Sorted (Fixed)

Not Yet Sorted

Comparisons: 0 Swaps: 0

Speed

💡 Each pass "bubbles" the largest unsorted value to its correct position. After k passes, the last k elements are sorted.

Input

Comma-separated integers (max 16).

Pseudocode

for pass = 0 to n-2: for j = 0 to n-pass-2: if arr[j] > arr[j+1]: swap arr[j] and arr[j+1] arr[n-pass-1] is now sorted ✓

Step Log

Complexity

Best Case	O(n)
Worst Case	O(n²)
Average	O(n²)
Space	O(1)