A high-speed sorting procedure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A high-speed sorting procedure

Full text

Pdf (184 KB)

Source

Communications of the ACM archive
Volume 3 , Issue 1 (January 1960) table of contents

Pages: 20 - 22

Year of Publication: 1960

ISSN:0001-0782

Authors

R. M. Frank	Los Alamos Scientific Lab, Los Alamos, NM
R. B. Lazarus	Los Alamos Scientific Lab, Los Alamos, NM

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 37, Citation Count: 7

Additional Information:

abstract references cited by collaborative colleagues peer to peer

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/366947.366957 What is a DOI?

ABSTRACT

In a recent note1, D. L. Shell has described a high-speed sorting procedure for lists contained in internal memory. The method has the great virtues of requiring no additional memory space and being considerably faster than other such methods, which require a time proportional to the square of the list length. The present authors have studied the statistics of Shell's method and have found a minor modification which increases its speed still further.

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.

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 7

	Thomas N. Hibbard, A Simple Sorting Algorithm, Journal of the ACM (JACM), v.10 n.2, p.142-150, April 1963
	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
	Michael H. Hall, A method of comparing the time requirements of sorting methods, Communications of the ACM, v.6 n.5, p.259-263, May 1963
	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
	Thomas N. Hibbard, An empirical study of minimal storage sorting, Communications of the ACM, v.6 n.5, p.206-213, May 1963
	R. Cypher, A lower bound on the size of shellsort networks, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.58-63, June 18-21, 1989, Santa Fe, New Mexico, United States
	W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971

Collaborative Colleagues:

R. M. Frank: colleagues

R. B. Lazarus: colleagues

Peer to Peer - Readers of this Article have also read:

Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein
Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM 34, 12
Ellen Francik , Susan Ehrlich Rudman , Donna Cooper , Stephen Levine
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski

Adobe Acrobat

QuickTime

Windows Media Player

Real Player