1

BECKENBACH, E. F., AND BELLMAN, R. Inequalities. Springer, New York, 1961.

2

VAN EMDEN, M. H. Iets quicker dan quicker. Informatic 11 (1969), 30-32.

3

FRAZER, W. D., AND MCKELLAR, A. C. Samplesort: a sampling approach to minimal storage time sorting. In proc. of the Third Annual Princeton Conf. on Information Sciences and Systems, 1969, 276280.

4

C. A. R. Hoare, Algorithm 64: Quicksort, Communications of the ACM, v.4 n.7, p.321, July 1961  [doi>10.1145/366622.366644]

5

HOARE, C. A. R. Quicksort. Comput. J. 5 (1962), 10-15.

6

KRUSEMAN ARETZ, F. E. J. Private communication.

7

Claude E. Shannon , Warren Weaver, A Mathematical Theory of Communication, University of Illinois Press, Champaign, IL, 1963

8

VAN WIJNGARE, A. Private communication.

9

M. H. van Emden, Algorithms 402: Increasing the efficiency of quicksort, Communications of the ACM, v.13 n.11, p.693-694, Nov 1970  [doi>10.1145/362790.362803]

Stefan Edelkamp , Patrick Stiegeler, Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons, Journal of Experimental Algorithmics (JEA), 7, p.5, 2002

Colin McDiarmid , Ryan Hayward, Strong concentration for Quicksort, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.414-421, September 1992, Orlando, Florida, United States

Rudolf Loeser, Some performance tests of “quicksort” and descendants, Communications of the ACM, v.17 n.3, p.143-152, March 1974

W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971

H. Hurwitz, Jr., On the probability distribution of the values of binary trees, Communications of the ACM, v.14 n.2, p.99-102, Feb. 1971

Jon L. Bentley , Robert Sedgewick, Fast algorithms for sorting and searching strings, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.360-369, January 05-07, 1997, New Orleans, Louisiana, United States

M. H. van Emden, Algorithms 402: Increasing the efficiency of quicksort, Communications of the ACM, v.13 n.11, p.693-694, Nov 1970

Alois Panholzer, Analysis of multiple quickselect variants, Theoretical Computer Science, v.302 n.1-3, p.45-91, 13 June 2003

David Podgorelec , Gregor Klajnšek, Acceleration of sweep-line technique by employing smart quicksort, Information Sciences—Informatics and Computer Science: An International Journal, v.169 n.3-4, p.383-408, 1 February 2005

H. M. Okasha , U. Rösler, Asymptotic distributions for Random Median Quicksort, Journal of Discrete Algorithms, v.5 n.3, p.592-608, September, 2007

E. M. Reingold, Establishing lower bounds on algorithms: a survey, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada

H. Lorin, A guided bibliography to sorting, IBM Systems Journal, v.10 n.3, p.244-254, September 1971