q sort

(algorithm)

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 ...)
sort.

Aggregate child (... is a part of or used in me.)
quicksort, insertion sort.

Author: DCR

Implementation

demonstration and source code (Java), GNU libc qsort (C), Apple Opensource qsort (C).

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 25 March 2016.
HTML page formatted Mon May 11 15:07:57 2026.

Cite this as:
David C. Rankin, "q sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 25 March 2016. (accessed TODAY) Available from: /HTML/qsort.html