The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sorting on Electronic Computer Systems
Journal of the ACM (JACM)
Sorting by Address Calculation
Journal of the ACM (JACM)
Sorting Cards with Respect to a Modulus
Journal of the ACM (JACM)
Radix Exchange—An Internal Sorting Method for Digital Computers
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computer Time for Address Calculation Sorting
Journal of the ACM (JACM)
Analysis of Internal Computer Sorting
Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Oscillating Sort—A New Sort Merging Technique
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Concerning the Merging of Equal Length Tape Files
Journal of the ACM (JACM)
Internal Sorting by Radix Plus Sifting
Journal of the ACM (JACM)
The Use of Information in Sorting
Journal of the ACM (JACM)
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
Remark on algorithm 347 [M1]: an efficient algorithm for sorting with minimal storage
Communications of the ACM
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification
Communications of the ACM
Remark on algorithm 201 [M1]: shellsort
Communications of the ACM
Sorting in a paging environment
Communications of the ACM
Increasing the efficiency of quicksort
Communications of the ACM
Remark on algorithm 347: An efficient algorithm for sorting with minimal storage
Communications of the ACM
Algorithms 402: Increasing the efficiency of quicksort
Communications of the ACM
Optimum merging from mass storage
Communications of the ACM
Communications of the ACM
Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
Sorting by replacement selecting
Communications of the ACM
A generalized partial pass block sort
Communications of the ACM
Remark on algorithm 175: Shuttle sort
Communications of the ACM
Certification of Algorithm 207: Stringsort
Communications of the ACM
Communications of the ACM
Certification of Algorithm 271: Quickersort
Communications of the ACM
Communications of the ACM
Certification of algorithm 245 [M1]: TREESORT
Communications of the ACM
Communications of the ACM
Internal and tape sorting using the replacement-selection technique
Communications of the ACM
An empirical study of minimal storage sorting
Communications of the ACM
Communications of the ACM
String distribution for the polyphase sort
Communications of the ACM
Read-backward polyphase sorting
Communications of the ACM
A comparison between the polyphase and oscillating sort techniques
Communications of the ACM
Certification of algorithm 23: MATHSORT
Communications of the ACM
Communications of the ACM
A tape file merge pattern generator
Communications of the ACM
Sorting nonredundant files—techniques used in the FACT compiler
Communications of the ACM
Sorting with large volume, random access, drum storage
Communications of the ACM
Some characteristics of sorting computing systems using random access storage devices
Communications of the ACM
Communications of the ACM
A method of comparing the time requirements of sorting methods
Communications of the ACM
Conversion, reconversion and comparison techniques in variable-length sorting
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Communications of the ACM
A generalized polyphase merge algorithm
Communications of the ACM
Algorithm 76: Sorting procedures
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
Communications of the ACM
Communications of the ACM
An estimation of the relative efficiency of two internal sorting methods
Communications of the ACM
Certification of algorithms 63, 64 and 65, partition, quicksort, and find
Communications of the ACM
Letters to the editor: three letters on merging
Communications of the ACM
Communications of the ACM
Certification of algorithm 175: shuttlesort
Communications of the ACM
Remark on Algorithm 76: Sorting procedures
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
Length of strings for a merge sort
Communications of the ACM
Communications of the ACM
Communications of the ACM
Certification of Algorithms 63, 64, 65: Partition, quicksort, find
Communications of the ACM
A dispersion pass algorithm for the polyphase merge
Communications of the ACM
Communications of the ACM
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
ACM '59 Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery
The effect of simultaneity on sorting operations
ACM '59 Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery
Variable word sorting in the RCA 501 system
ACM '59 Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery
Information retrieval: information storage and retrieval using AVL trees
ACM '65 Proceedings of the 1965 20th national conference
Analysis of computational systems: Cumulative polygon address calculation sorting
ACM '65 Proceedings of the 1965 20th national conference
ACM '62 Proceedings of the 1962 ACM national conference on Digest of technical papers
Non-uniform key distribution and address calculation sorting
ACM '66 Proceedings of the 1966 21st national conference
Computer Sorting
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Best sorting algorithm for nearly sorted lists
Communications of the ACM
Algorithm 488: A Gaussian pseudo-random number generator
Communications of the ACM
Communications of the ACM
Sorting sequential files with limited auxiliary storage
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Partitioned parallel radix sort
Journal of Parallel and Distributed Computing
An approach for pattern oriented software development based on a design handbook
Annals of Software Engineering
Bubble sort: an archaeological algorithmic analysis
SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
Prospects for an Engineering Discipline of Software
IEEE Software
Partitioned Parallel Radix Sort
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Encyclopedia of Computer Science
Efficient implementation of sorting on multi-core SIMD CPU architecture
Proceedings of the VLDB Endowment
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
The growing-tree sorting algorithm
WSEAS Transactions on Information Science and Applications
Hi-index | 0.05 |
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.