📊 Sortalizer

Watch algorithms think, one swap at a time

0 comparisons
0 swaps

Bubble Sort

O(n²)

Repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

Best O(n)
Worst O(n²)
Space O(1)
Unsorted
Comparing
Swapping
Pivot
Sorted
Keyboard
Space Play/Pause
R Reset
M Mute