Bubble Sort
In plain terms
A simple sort that repeatedly swaps adjacent out-of-order items.
Going deeper
Bubble sort passes through the list swapping neighbors until sorted, which is easy to understand but inefficient. It's mainly a teaching example.
Under the hood
O(n²) time makes it impractical at scale; its only virtue is simplicity and detecting an already-sorted list early.
Examples
Teaching sorting basics, tiny datasets, algorithm intros.
Think of it like...
Like bubbles rising: the biggest values float to the end one pass at a time.