Sorting Visualization

interactive Animate common sorting algorithms

Algorithm Notes

Summary: Build max-heap, repeatedly extract max to end.
Time: Best/Avg/Worst O(n log n)
Space: O(1) in-place (array heap)
Stability: Not stable
When to use: O(1) extra memory requirement with predictable O(n log n).

Big-O Guide

Ready