Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Full text

Pdf (964 KB)

Source

Communications of the ACM archive
Volume 12 , Issue 3 (March 1969) table of contents

Pages: 185 - 186

Year of Publication: 1969

ISSN:0001-0782

Author

Richard C. Singleton

Stanford Research Institute, Menlo Park, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 44, Citation Count: 15

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/362875.362901 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	Charles R. Blair, Certification of Algorithm 271: Quickersort, Communications of the ACM, v.9 n.5, p.354, May 1966 [doi>10.1145/355592.365613]
	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]
	4	C. A. R. Hoare, Algorithm 63: partition, Communications of the ACM, v.4 n.7, p.321, July 1961 [doi>10.1145/366622.366642]
	5	R. S. Scowen, Algorithm 271: quickersort, Communications of the ACM, v.8 n.11, p.669-670, Nov. 1965 [doi>10.1145/365660.365678]
	6	D. L. Shell, A high-speed sorting procedure, Communications of the ACM, v.2 n.7, p.30-32, July 1959 [doi>10.1145/368370.368387]

CITED BY 14

	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971
	Roger L. Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM, v.28 n.4, p.396-402, April 1985
	Wolfgang Janko, A List Insertion Sort for Keys With Arbitrary Key Distribution, ACM Transactions on Mathematical Software (TOMS), v.2 n.2, p.143-153, June 1976
	H. D. Baecker, Garbage collection for virtual memory computer systems, Communications of the ACM, v.15 n.11, p.981-986, Nov. 1972
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.29 n.4, p.331-335, April 1986
	J. M. Chambers, Algorithm 410 Partial sorting, Communications of the ACM, v.14 n.5, p.357-358, May 1971
	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
	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
	Robert Sedgewick, Implementing Quicksort programs, Communications of the ACM, v.21 n.10, p.847-857, Oct. 1978
	Dalia Motzkin, Pracniques: Meansort, Communications of the ACM, v.26 n.4, p.250-251, April 1983
	Olivier Lecarme, Structured programming, programming teaching and the language Pascal, ACM SIGPLAN Notices, v.9 n.7, p.15-21, July 1974
	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
	Markus Hegland, Implementing partition on vector computers, Proceedings of the 5th international conference on Supercomputing, p.304-311, June 17-21, 1991, Cologne, West Germany
	Dalia Motzkin , John Kapenga, Technical Correspondence—MEANSORT (April 1983): response from Dalia Motzkin with John Kapenga, Communications of the ACM, v.27 n.7, p.719-722, July 1984