Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Algorithm 271: quickersort

Published: 01 November 1965 Publication History

Abstract

No abstract available.

References

[1]
HOARE, C. A.R. Algorithms 03 and 64. Comm. ACM 4 (July 1961), 321.
[2]
HIBBARD, THOMAS N. Some combinatorial properties of certain trees with applications to searching and sorting. J. ACM 9 (Jan. 1962), 13.
[3]
___, An empirical study of minimal storage sorting. Comm,. ACM 6 (May 1963), 206-213

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 8, Issue 11
Nov. 1965
85 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/365660
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1965
Published in CACM Volume 8, Issue 11

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)161
  • Downloads (Last 6 weeks)19
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2019)QuickhullDisk: A faster convex hull algorithm for disksApplied Mathematics and Computation10.1016/j.amc.2019.124626363(124626)Online publication date: Dec-2019
  • (2019)A Faster Convex-Hull Algorithm via BucketingAnalysis of Experimental Algorithms10.1007/978-3-030-34029-2_30(473-489)Online publication date: 14-Nov-2019
  • (2018)Convex-Hull Algorithms: Implementation, Testing, and ExperimentationAlgorithms10.3390/a1112019511:12(195)Online publication date: 28-Nov-2018
  • (2015)CrowdwareProceedings of the 2015 IEEE 7th International Conference on Cloud Computing Technology and Science (CloudCom)10.1109/CloudCom.2015.73(266-273)Online publication date: 30-Nov-2015
  • (2014)Identifying Node Role in Social Network Based on Multiple IndicatorsPLoS ONE10.1371/journal.pone.01037339:8(e103733)Online publication date: 4-Aug-2014
  • (2011)BibliographySorting10.1002/9781118032886.biblio(373-387)Online publication date: 26-Oct-2011
  • (2006)Exploiting partial order with QuicksortSoftware: Practice and Experience10.1002/spe.438014060314:6(509-518)Online publication date: 30-Oct-2006
  • (2006)A stable quicksortSoftware: Practice and Experience10.1002/spe.438011060411:6(607-611)Online publication date: 27-Oct-2006
  • (2006)The portable compiling systems of MUSSSoftware: Practice and Experience10.1002/spe.43800908059:8(645-655)Online publication date: 27-Oct-2006
  • (2005)Acceleration of sweep-line technique by employing smart quicksortInformation Sciences: an International Journal10.1016/j.ins.2004.07.002169:3-4(383-408)Online publication date: 1-Feb-2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media