Definition: The quicksort implementation in many libraries. It is generally a combination of quicksort, for large partitions, and insertion sort, for small partitions.
Generalization (I am a kind of ...)
Aggregate child (... is a part of or used in me.)
quicksort, insertion sort.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 25 March 2016.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
David C. Rankin, "q sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 March 2016. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/qsort.html