Astrelin, Andrey. 2013. “Grailsort.”
Axtmann, Michael, Sascha Witt, Daniel Ferizovic, and Peter Sanders. 2017. In-Place Parallel Super Scalar Samplesort (IPSSSSo).” In 25th Annual European Symposium on Algorithms (ESA 2017), edited by Kirk Pruhs and Christian Sohler, 87:9:1–14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
———. 2022. “Engineering in-Place (Shared-Memory) Sorting Algorithms.” ACM Trans. Parallel Comput. 9 (1).
Bender, Michael A., Martin Farach-Colton, and Miguel A. Mosteiro. 2006. “Insertion Sort Is o(n Log n).” Theory of Computing Systems 39 (3): 391–97.
Bentley, Jon L., and M. Douglas McIlroy. 1993. “Engineering a Sort Function.” Softw. Pract. Exper. 23 (11): 1249–65.
Dongarra, Jack J. 2022. “The Evolution of Mathematical Software.” Commun. ACM 65 (12): 66–72.
Edelkamp, Stefan, and Armin Weiß. 2016. “BlockQuicksort: How Branch Mispredictions Don’t Affect Quicksort.” CoRR abs/1604.06697.
Hoare, C. A. R. 1961a. “Algorithm 63: Partition.” Commun. ACM 4 (7): 321.
———. 1961b. “Algorithm 64: Quicksort.” Commun. ACM 4 (7): 321.
———. 1961c. “Algorithm 65: Find.” Commun. ACM 4 (7): 321–22.
———. 1962. Quicksort.” The Computer Journal 5 (1): 10–16.
Huang, B.-C., and M. A. Langston. 1992. “Fast Stable Merging and Sorting in Constant Extra Space.” J-COMP-J 35 (6): 643–50.
Katajainen, Jyrki, and Jesper Larsson Träff. 1997. “A Meticulous Analysis of Mergesort Programs.” In Algorithms and Complexity, edited by Giancarlo Bongiovanni, Daniel Pierre Bovet, and Giuseppe Di Battista, 217–28. Berlin, Heidelberg: Springer Berlin Heidelberg.
Knuth, Donald. 1973. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley.
Knuth, Donald E. 1998. The Art of Computer Programming, Volume 3: (2nd Ed.) Sorting and Searching. Redwood City, CA, USA: Addison Wesley Longman Publishing Co., Inc.
Mehlhorn, K. 1977. Data Structures and Algorithms. Vol. 1: Sorting and Searching. Stuttgart, Leipzig: Teubner.
Munro, J. Ian, and Sebastian Wild. 2018. Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.” In 26th Annual European Symposium on Algorithms (ESA 2018), edited by Yossi Azar, Hannah Bast, and Grzegorz Herman, 112:63:1–16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
Peters, Orson. 2014. [PATCH] Bug 20837 - Libc++ Std::sort Has o(n²) Worst Case, Standard Mandates o(n Log(n)).” llvm bug report.
———. 2015. “Pdqsort.” github code.
Peters, Orson R. L. 2021a. “Agreed on Pdqsort ...” Hacker News.
———. 2021b. “Pattern-Defeating Quicksort.” CoRR abs/2106.05123.
Peters, Tim. 2002. “I Wrote a Sort for Python.” ’Sorting’ mail to the Python-Dev list.
Sedgewick, Robert. 1977. “Quicksort with Equal Keys.” SIAM J. Comput, 240–67.
———. 1990. Algorithms in c. 2nd ed. Addison-Wesley Professional.
Singleton, Richard C. 1969. “Algorithm 347: An Efficient Algorithm for Sorting with Minimal Storage [M1].” Commun. ACM 12 (3): 185–86.
Skarupke, Malte. 2016. “I Wrote a Faster Sorting Algorithm.”
The UK Parliamentary Office of Science and Technology. 2022. “Energy Consumption of ICT.” UK Parliament POST.
von Leitner, Felix. 2007. “Diet Libc - a Libc Optimized for Small Size.”
Wegner, Lutz M. 1985. “Quicksort for Equal Keys.” IEEE Trans. Computers 34 (4): 362–67.
Yaroslavskiy, Vladimir. 2009. “Dual-Pivot Quicksort.”