Watch Elements Bubble Up!
How it works: Compare adjacent elements, swap if out of order. Largest "bubbles up" to the end.
Time Complexity: O(n²) worst/average,
O(n) best (already sorted)
Space: O(1) - In-place sorting
Stable: Yes - Equal elements maintain relative order