Sorting Visualization

interactive Animate common sorting algorithms

Algorithm Notes

Summary: Build sorted prefix by inserting each element into position.
Time: Best O(n), Avg/Worst O(n^2)
Space: O(1) in-place
Stability: Stable
When to use: Nearly sorted data, small arrays, as base-case for hybrid sorts.

Big-O Guide

Ready