Hoare, C. A. R.: Quicksort. In:
The Computer Journal 5 (1962), Nr. 1, S. 10-16
[Volltext]
[Kurzfassung]
[BibTeX]
A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.
Hoare, C. A. R.: Algorithm 64: Quicksort.. In:
Commun. ACM 4 (1961), Nr. 7, S. 321
[Volltext]
[BibTeX]
Cormen, T. H.:
Introduction to algorithms. Cambridge, Masachusetts; London: The MIT Press, 2009
[Volltext]
[BibTeX]
Flores, I.: Analysis of Internal Computer Sorting.. In:
J. ACM 8 (1961), Nr. 1, S. 41-80
[Volltext]
[BibTeX]
Bron, C.: Merge Sort Algorithm [M1] (Algorithm 426).. In:
Commun. ACM 15 (1972), Nr. 5, S. 357-358
[Volltext]
[BibTeX]
Bron, C.: Merge Sort Algorithm (Remark on Algorithm 426).. In:
Commun. ACM 17 (1974), Nr. 12, S. 706
[Volltext]
[BibTeX]