Algorithm 64: Quicksort

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 64: Quicksort

Full text

Pdf (174 KB)

Source

Communications of the ACM archive
Volume 4 , Issue 7 (July 1961) table of contents

Page: 321

Year of Publication: 1961

ISSN:0001-0782

Author

C. A. R. Hoare

Elliott brothers Ltd., Hertfordshire, England, U.K.

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

cited by 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/366622.366644 What is a DOI?

CITED BY 24

	Marc Daumas , Paraskevas Evripidou, Parallel Implementations of the Selection Problem: A Case Study, International Journal of Parallel Programming, v.28 n.1, p.103-131, February 2000
	Roger L. Wainwright, A class of sorting algorithms based on Quicksort, Communications of the ACM, v.28 n.4, p.396-402, April 1985
	M. H. van Emden, Increasing the efficiency of quicksort, Communications of the ACM, v.13 n.9, p.563-567, Sept. 1970
	Colin McDiarmid , Ryan Hayward, Strong concentration for Quicksort, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.414-421, September 1992, Orlando, Florida, United States
	Rudolf Loeser, Some performance tests of “quicksort” and descendants, Communications of the ACM, v.17 n.3, p.143-152, March 1974
	Hua-Huai Chern , Hsien-Kuei Hwang , Tsung-Hsi Tsai, An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms, Journal of Algorithms, v.44 n.1, p.177-225, July 2002
	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
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.29 n.4, p.331-335, April 1986
	Robert Sedgewick, Implementing Quicksort programs, Communications of the ACM, v.21 n.10, p.847-857, Oct. 1978
	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
	W. K. Giloi , R. Hoffmann, Adding a modern control structure to APL without changing the syntax, Proceedings of the eighth international conference on APL, p.189-194, September 22-24, 1976, Ottawa, Canada
	M. H. van Emden, Algorithms 402: Increasing the efficiency of quicksort, Communications of the ACM, v.13 n.11, p.693-694, Nov 1970
	Ranjan Sinha , Justin Zobel , David Ring, Cache-efficient string sorting using copying, Journal of Experimental Algorithmics (JEA), 11, 2006
	Scott Sirowy , Greg Stitt , Frank Vahid, C is for circuits: capturing FPGA circuits as sequential code for portability, Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays, February 24-26, 2008, Monterey, California, USA
	James Harris, Using computer algebra systems in the teaching of analysis of recursive functions, Journal of Computing Sciences in Colleges, v.21 n.5, p.116-122, May 2006
	Kyle D. Ross, Towards an automatic complexity analysis for generic programs, Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming, September 16-16, 2006, Portland, Oregon, USA
	H. M. Okasha , U. Rösler, Asymptotic distributions for Random Median Quicksort, Journal of Discrete Algorithms, v.5 n.3, p.592-608, September, 2007
	Sunny Y. Wang, A new sort algorithm: self-indexed sort, ACM SIGPLAN Notices, v.31 n.3, p.28-36, March 1996
	Amr Elmasry , Abdelrahman Hammad, Inversion-sensitive sorting algorithms in practice, Journal of Experimental Algorithmics (JEA), 13, February 2009
	Gagan Aggarwal , Nir Ailon , Florin Constantin , Eyal Even-Dar , Jon Feldman , Gereon Frahling , Monika R. Henzinger , S. Muthukrishnan , Noam Nisan , Martin Pál , Mark Sandler , Anastasios Sidiropoulos, Theory research at Google, ACM SIGACT News, v.39 n.2, June 2008
	Erik Sintorn , Ulf Assarsson, Real-time approximate sorting for self shadowing and transparency in hair rendering, Proceedings of the 2008 symposium on Interactive 3D graphics and games, February 15-17, 2008, Redwood City, California
	Erik Sintorn , Ulf Assarsson, Fast parallel GPU-sorting using a hybrid algorithm, Journal of Parallel and Distributed Computing, v.68 n.10, p.1381-1388, October, 2008
	Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz, On the adaptiveness of Quicksort, Journal of Experimental Algorithmics (JEA), 12, June 2008
	Edgar G. Daylight , Arnout Vandecappelle , Francky Catthoor, The formalism underlying EASYMAP: A precompiler for refinement-based exploration of hierarchical data organizations, Science of Computer Programming, v.72 n.3, p.71-135, August, 2008

Collaborative Colleagues:

C. A. R. Hoare: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player