Definition: The sort function in many libraries. It is generally a combination of quicksort, for many items, and insertion sort, for a few items.
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 19 January 2021.
HTML page formatted Tue Jan 19 08:57:16 2021.
Cite this as:
David C. Rankin, "q sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 January 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/qsort.html