Skip Navigation

The Computer Journal 1962 5(1):10-16; doi:10.1093/comjnl/5.1.10
© 1962 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (211)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hoare, C. A. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Quicksort

C. A. R. Hoare

Elliott Bros. (London) Ltd., Borehamwood, Herts., UK

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Journal of Information ScienceHome page
N. Al-Darwish
Formulation and analysis of in-place MSD radix sort algorithms
Journal of Information Science, December 1, 2005; 31(6): 467 - 481.
[Abstract] [PDF]

Home page
 Bulletin of the Seismological Society of AmericaHome page
J. R. EVANS
Running median filters and a general despiker
Bulletin of the Seismological Society of America, February 1, 1982; 72(1): 331 - 338.
[PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.