Bubble sort: swap neighbours until nothing moves
Six numbers are sorted using bubble sort, with each pass comparing neighboring values and swapping them when the left is larger, gradually pushing the largest remaining value to its correct position on the right. A running swap counter tracks total operations, and the animation highlights how the algorithm detects a pass with zero swaps to exit early. Useful for students learning basic sorting algorithms and time complexity intuition.
16:9 · Preview before teaching · automatic layout checks do not establish subject accuracy
The prompt that made it
Six values sorted by bubble sort: each pass compares neighbours and swaps when the left is bigger, floating the largest to the right; swap counter and early exit when a pass makes no swaps.
Make the next one in this series
- Compare bubble sort and selection sort side by side on the same six values
- Show best case, average case, and worst case time complexity for bubble sort
- Animate insertion sort on the same six values to contrast the swapping strategy
