VisualSort

Bubble Sort

Like bubbles rising to the surface, this algorithm repeatedly steps through the list, comparing adjacent pairs of elements and swapping them if they're out of order. With each pass, the largest unsorted element 'bubbles up' to its correct position at the end. While simple to understand, it's generally inefficient for large datasets.