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 17 June 2019.
HTML page formatted Mon Jun 17 08:46:48 2019.
Cite this as:
David C. Rankin, "q sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 June 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/qsort.html