Some performance tests of “quicksort” and descendants

Authors:
Rudolf Loeser
Affiliations:
Smithsonian Insitution, Cambridge, MA
Venue:
Communications of the ACM
Year:
1974

Citing 12
Cited 8

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification

Communications of the ACM
Increasing the efficiency of quicksort

Communications of the ACM
Algorithms 402: Increasing the efficiency of quicksort

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Certification of Algorithm 271: Quickersort

Communications of the ACM
Algorithm 266: pseudo-random numbers [G5]

Communications of the ACM
Algorithm 271: quickersort

Communications of the ACM
Certification of algorithm 245 [M1]: TREESORT

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM
Algorithm 207: stringsort

Communications of the ACM
Certification of Algorithms 63, 64, 65: Partition, quicksort, find

Communications of the ACM

A class of sorting algorithms based on Quicksort

Communications of the ACM - Lecture notes in computer science Vol. 174
Quicksort algorithms with an early exit for sorted subfiles

CSC '87 Proceedings of the 15th annual conference on Computer Science
Survey on Algorithms 347, 426, and Quicksort

ACM Transactions on Mathematical Software (TOMS)
Pracniques: Meansort

Communications of the ACM
Best sorting algorithm for nearly sorted lists

Communications of the ACM
Implementing Quicksort programs

Communications of the ACM
A critical overview of computer performance evaluation

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Cost evaluation of storage schemes

ACM '74 Proceedings of the 1974 annual conference - Volume 1

Quantified Score

Hi-index	48.26

Visualization

Abstract

Detailed performance evaluations are presented for six ACM algorithms: quicksort (No. 64), Shellsort (No. 201), stringsort (No. 207), “TREESORT3” (No. 245), quickersort (No. 271), and qsort (No. 402). Algorithms 271 and 402 are refinements of algorithm 64, and all three are discussed in some detail. The evidence given here demonstrates that qsort (No. 402) requires many more comparisons than its author claims. Of all these algorithms, quickersort requires the fewest comparisons to sort random arrays.