Intro Sort
Introspective Sort — Quick Sort + Heap Sort + Insertion Sort hybrid (Musser, 1997)
Best O(n log n)
Avg O(n log n)
Worst O(n log n) (guaranteed)
Space O(log n)
Unstable
Load
Random
Sorted
Reverse
Killer
Start
Step
Pause
Reset
Slow
Fast
n
0
Depth Limit
0
Current Depth
0
Algorithm
—
Partitions
0
Heap Fallbacks
0
Insertion Calls
0
Step
0 / 0
default
pivot
partition-left
partition-right
heapifying
insertion-moving
sorted
Step Explanation
Press
Start
to run, or
Step
for single-step mode.
Complexity
Case
Time
Space
Stable
Best
O(n log n)
O(log n)
No
Average
O(n log n)
O(log n)
No
Worst
O(n log n) — guaranteed by heap fallback
O(log n)
No
Operation Log