(algorithm)
Definition: A variant of quicksort which switches to heapsort for pathological inputs, that is, when execution time is becoming quadratic.
Also known as introsort.
Author: PEB
abstract and link to Musser's paper
David R. Musser, Introspective Sorting and Selection Algorithms, Software-Practice and Experience, 8:983-993, 1997.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:04 2006.
Cite this as:
Paul E. Black, "introspective sort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/introspectiveSort.html
