Algorithm 271: quickersort

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 271: quickersort

Full text

Pdf (221 KB)

Source

Communications of the ACM archive
Volume 8 , Issue 11 (November 1965) table of contents

Pages: 669 - 670

Year of Publication: 1965

ISSN:0001-0782

Author

R. S. Scowen

National Physical Lab, Teddington, England, UK

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 27, Citation Count: 14

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/365660.365678 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	HOARE, C. A.R. Algorithms 03 and 64. Comm. ACM 4 (July 1961), 321.
	2	Thomas N. Hibbard, Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting, Journal of the ACM (JACM), v.9 n.1, p.13-28, Jan. 1962 [doi>10.1145/321105.321108]
	3	Thomas N. Hibbard, An empirical study of minimal storage sorting, Communications of the ACM, v.6 n.5, p.206-213, May 1963 [doi>10.1145/366552.366557]

CITED BY 15

	Richard C. Singleton, Algorithm 347: an efficient algorithm for sorting with minimal storage [M1], Communications of the ACM, v.12 n.3, p.185-186, March 1969
	J. Morris, ACM Algorithm 346: F-Test Probabilities, Communications of the ACM, v.12 n.3, p.184-185, March 1969
	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
	Robin Griffin , K. A. Redish, Remark on algorithm 347 [M1]: an efficient algorithm for sorting with minimal storage, Communications of the ACM, v.13 n.1, p.54, Jan. 1970
	Roger L. Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM, v.28 n.4, p.396-402, April 1985
	C. Bron, Merge sort algorithm [M1], Communications of the ACM, v.15 n.5, p.357-358, May 1972
	Rudolf Loeser, Some performance tests of “quicksort” and descendants, Communications of the ACM, v.17 n.3, p.143-152, March 1974
	J. K. S. McKay, Algorithm 371: Partitions in natural order [A1], Communications of the ACM, v.13 n.1, p.52, Jan. 1970
	Roger L. Wainwright, Quicksort algorithms with an early exit for sorted subfiles, Proceedings of the 15th annual conference on Computer Science, p.183-190, February 1987, St. Louis, Missouri, United States
	Curtis R. Cook , Do Jin Kim, Best sorting algorithm for nearly sorted lists, Communications of the ACM, v.23 n.11, p.620-624, Nov. 1980
	Dalia Motzkin, Pracniques: Meansort, Communications of the ACM, v.26 n.4, p.250-251, April 1983
	William F. Eddy, A New Convex Hull Algorithm for Planar Sets, ACM Transactions on Mathematical Software (TOMS), v.3 n.4, p.398-403, Dec. 1977
	M. H. van Emden, Algorithms 402: Increasing the efficiency of quicksort, Communications of the ACM, v.13 n.11, p.693-694, Nov 1970
	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. Lorin, A guided bibliography to sorting, IBM Systems Journal, v.10 n.3, p.244-254, September 1971