Bubble sort
How it works
Bubble Sort works by repeatedly comparing and swapping adjacent elements if they are in the wrong order. The largest elements "bubble up" to the end, just like bubbles rising in water!
-
🔹 Compare two elements → Swap if needed → Repeat until sorted.
-
🔹 Best case: Already sorted? ✅ Only takes O(n) time!
-
🔹 Worst case: Lots of swaps, runs in O(n²).
-
🔹 Why learn it? It's simple and helps you understand swapping logic.
👀 Think of it as: Sorting a deck of cards by repeatedly checking neighbors.
How it works in code
How to play
Goal: Swap adjacent elements until the list is sorted.
Buttons:
-
Skip ⏭️ → Moves to the next pair without swapping.
-
Swap 🔄 → Swaps the current two elements.
-
Submit ✅ → Checks if the list is fully sorted.
👀 Tip: Keep swapping until the largest elements "bubble up" to the end!
Time:
0:60
Lives:
❤️❤️❤️