Algorithm: Bubbly
Comparison: 0
Copy/Paste: 0
State: Ready for start

Bubble sort sequentially compares adjacent elements and swaps them if they are in the wrong order—so the largest elements 'bubble' to the end with O(n²) comparisons.

💡 Real-world example: choosing a sorting algorithm affects the speed of databases, search indexes, and list sorting in applications — on large arrays, the difference between O(n²) and O(n log n) is seconds versus hours.