Sorting Visualization
Algorithm Notes
Summary: Partition around a pivot; recursively sort partitions.
Time: Best/Avg O(n log n), Worst O(n^2) (poor pivots)
Space: O(log n) average stack, O(n) worst stack
Stability: Not stable (typical in-place)
Notes: Use randomized/median-of-three pivot; switch to insertion sort for small slices.
Ready