Sorting Visualization

interactive Animate common sorting algorithms

Algorithm Notes

Summary: Divide-and-conquer; recursively sort halves then merge.
Time: Best/Avg/Worst O(n log n)
Space: O(n) auxiliary (linked-list variant can be O(1))
Stability: Stable
When to use: Guaranteed O(n log n), external sorting, stable requirement.

Big-O Guide

Ready