Skip to content

Glossary: Data Structures and Algorithms in Java

quicksort

Also written: dual-pivot quicksort

A sort that Java uses for arrays of primitives such as `int[]`. It is O(n log n) on typical data and not stable, which does not matter for plain numbers.

Where the book teaches it

Related terms

TimSortstable sort