Survey on Algorithms 347, 426, and Quicksort

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Survey on Algorithms 347, 426, and Quicksort

Full text

Pdf (770 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 , Issue 3 (September 1976) table of contents

Pages: 290 - 299

Year of Publication: 1976

ISSN:0098-3500

Author

Rudolf Loeser

Center for Astrophysics, Harvard College Observatory and Smithsonian, Astrophysical Observatory, Cambridge, MA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 25, Citation Count: 2

Additional Information:

references cited by index terms

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/355694.355702 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	Rudolf Loeser, Some performance tests of “quicksort” and descendants, Communications of the ACM, v.17 n.3, p.143-152, March 1974 [doi>10.1145/360860.360870]
	2	RICH, R.P. Internal Sorting Methods. Prentice-Hall, Englewood Cliffs, N. j., 1972, pp. 89-91.
	3	PETO, R. Remark on Algorithm 347. Comm. ACM 13, 10 (Oct 1970), 624.
	1	BULTHEEL, A. Remark on Algorithm 450. Comm. ACM 17, 8 (Aug. 1974), 470.
	2	ROSENBROCK, H H. An automatic method for finding the greatest or least value of a functmn. Computer J. 3 (1960), 175-184.
	3	Box, M.J. A compamson of several current optimization methods and the use of transformations m constrained problems Computer J. 9 (1966), 67-77.
	1	Robert W. Floyd , Ronald L. Rivest, Expected time bounds for selection, Communications of the ACM, v.18 n.3, p.165-172, March 1975 [doi>10.1145/360680.360691]
	2	W. D. Frazer , A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, Journal of the ACM (JACM), v.17 n.3, p.496-507, July 1970 [doi>10.1145/321592.321600]
	3	C. A. R. Hoare, Algorithm 63: partition, Communications of the ACM, v.4 n.7, p.321, July 1961 [doi>10.1145/366622.366642]

CITED BY 2

	Roger L. Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM, v.28 n.4, p.396-402, April 1985
	Dalia Motzkin, Pracniques: Meansort, Communications of the ACM, v.26 n.4, p.250-251, April 1983

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

General Terms:
Algorithms, Performance, Theory, Verification

Adobe Acrobat

QuickTime

Windows Media Player

Real Player