Answers are grounded in this paper and cite their sources.
We recount the history of a new qsortfunction for a C library. Our function is clearer, faster and more robust than existing sorts. It chooses partitioning elements by a new sampling scheme; it partitions by a novel solution to Dijkstra's Dutch National Flag problem; and it swaps efficiently. Its behavior was assessed with timing and debugging testbeds, and with a program to certify performance. The design techniques apply in domains beyond sorting.
No takes yet. Share an insight, caveat, or question.
Bentley et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: