Introspective Sorting and Selection Algorithms.¶
Musser, D. R. (1997). Introspective Sorting and Selection Algorithms. Software: Practice and Experience, 27(8), 983-993.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Asymptotic Behavior
- The regime-validity range is the corrective discipline — the asymptotic conclusion holds only once \(n\) is large enough that the dominant term dominates, and many real libraries exploit exactly this by switching to insertion sort below a small cutoff and merge sort above it.
This sourceIntroduces introsort; standard implementations (e.g., libstdc++ std::sort) switch to insertion sort below a small input-size cutoff — exploiting the regime where discarded constants still dominate.
- The regime-validity range is the corrective discipline — the asymptotic conclusion holds only once \(n\) is large enough that the dominant term dominates, and many real libraries exploit exactly this by switching to insertion sort below a small cutoff and merge sort above it.
Domain-specific¶
- Big O Notation
- So hybrid algorithms like Timsort (Python, Java) and introsort (C++ std::sort) run an O(n log n) strategy at the top and switch to insertion sort below a small threshold
This sourceThe design of introsort, the hybrid that limits quicksort's partition depth and falls back to heapsort as a worst-case stopper, written for the C++ Standard Template Library.
Supported in partVerified against the publisher's abstract
“limit the depth of partitioning, and for subproblems that exceed the limit switch to another algorithm with a better worst-case bound. Using heapsort as the ‘stopper’ yields a sorting algorithm that is just as fast as quicksort in the average case, but also has an Θ(N log N) worst case time bound.”
- So hybrid algorithms like Timsort (Python, Java) and introsort (C++ std::sort) run an O(n log n) strategy at the top and switch to insertion sort below a small threshold
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:c5592f7e2d48 · see in the full table