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

skip to main content
article
Free access

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Published: 01 March 1969 Publication History
First page of PDF

References

[1]
BLAIR, CHARLES R. Certification of algorithm 271. Comm. ACM 9 (May 1966), 354.
[2]
HIRBARD, THOMAS N. Some combinatorial properties of certain trees with applications to searching and sorting. J . ACM 9 (Jan. 1962), 13-28.
[3]
HIBBARD, THOMAS N. An empirical study of minimal storage sorting. Comm. ACM 6 (May 1963), 206--213.
[4]
HOARE, C. A.R. Algorithms 63, Partition, and 64, Quicksort. Comm. ACM 4 (July 1961), 321.
[5]
SCOWEN, R. S. Algorithm 271, Quickersort. Comm. ACM 8 (Nov. 1965), 669.
[6]
SHELL, D. L. A high speed sorting procedure. Comm. ACM (July 1959), 30-32.

Cited By

View all
  • (2025)Three Steps Towards Robust RegressionPsychometrika10.1007/BF0229169541:1(9-34)Online publication date: 1-Jan-2025
  • (2024)Order statistics in large arrays (OSILA): a simple randomised algorithm for a fast and efficient attainment of the order statistics in very large arraysComputational Statistics10.1007/s00180-023-01381-139:7(3599-3624)Online publication date: 1-Dec-2024
  • (2023)Critical Analysis of Beta Random Variable Generation MethodsMathematics10.3390/math1124489311:24(4893)Online publication date: 6-Dec-2023
  • Show More Cited By

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 12, Issue 3
March 1969
87 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/362875
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 March 1969
Published in CACM Volume 12, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. digital computer sorting
  2. minimal storage sorting
  3. sorting

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)121
  • Downloads (Last 6 weeks)11
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Three Steps Towards Robust RegressionPsychometrika10.1007/BF0229169541:1(9-34)Online publication date: 1-Jan-2025
  • (2024)Order statistics in large arrays (OSILA): a simple randomised algorithm for a fast and efficient attainment of the order statistics in very large arraysComputational Statistics10.1007/s00180-023-01381-139:7(3599-3624)Online publication date: 1-Dec-2024
  • (2023)Critical Analysis of Beta Random Variable Generation MethodsMathematics10.3390/math1124489311:24(4893)Online publication date: 6-Dec-2023
  • (2023)Enhancing Performance of CUDA Quicksort Through Pivot Selection and Branching Avoidance Methods2023 XXIX International Conference on Information, Communication and Automation Technologies (ICAT)10.1109/ICAT57854.2023.10171304(1-5)Online publication date: 11-Jun-2023
  • (2022)Improving Quicksort Performance by Optimizing Branch Prediction2022 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)10.1109/CSDE56538.2022.10089318(1-6)Online publication date: 18-Dec-2022
  • (2020)Anwendungen der AbleitungAngewandte Mathematik 1 mit MATLAB und Julia10.1007/978-3-662-60952-1_9(229-250)Online publication date: 27-Mar-2020
  • (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)PREMERIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2017.275878615:4(1193-1202)Online publication date: 1-Jul-2018
  • (2018)An Algorithm for Fitting Johnson Transformations to Non-Normal DataJournal of Quality Technology10.1080/00224065.1999.1197993331:3(345-350)Online publication date: 20-Feb-2018
  • (2015)Average Case and Distributional Analysis of Dual-Pivot QuicksortACM Transactions on Algorithms10.1145/262934011:3(1-42)Online publication date: 13-Jan-2015
  • 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

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media