Bubble Sort

Folklore, 1956

One of the simplest sorting algorithms, bubble sort has been part of computer science folklore since the 1950s. It repeatedly passes through the array, comparing adjacent pairs and swapping them if out of order. Larger elements 'bubble' to the end with each pass. Though inefficient at O(n²), its simplicity makes it a classic teaching tool. The visualization shows bars with gold highlighting the current comparison pair and teal marking the sorted tail.