Sorting Visualization

interactive Animate common sorting algorithms

Algorithm Notes

Summary: Repeatedly swap adjacent out-of-order pairs; pushes largest to the end each pass.
Time: Best O(n) (already sorted + early exit), Avg O(n^2), Worst O(n^2)
Space: O(1) in-place
Stability: Stable
When to use: Teaching, tiny inputs, nearly-sorted with early exit.

Big-O Guide

Ready