Stats
Implementations
Introsort (Introspective Sort) is a hybrid sorting algorithm that begins with Quick Sort and switches to Heap Sort when the recursion depth exceeds a certain limit, guaranteeing O(n log n) worst-case performance while retaining excellent average-case behavior.
Paradigm
Hybrid / Divide and Conquer
Author
David Musser
Tier
STime Complexity
Best
O(n log n)Avg
O(n log n)Worst
O(n log n)Space
O(log n)Properties