Affiliation:
1. Smithsonian Insitution, Cambridge, MA
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.
Publisher
Association for Computing Machinery (ACM)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quicksort Algorithm—An Empirical Study;Proceedings of the Third International Conference on Computational Intelligence and Informatics;2020
2. Comparing Four Important Sorting Algorithms Based on Their Time Complexity;Proceedings of the 2019 2nd International Conference on Algorithms, Computing and Artificial Intelligence;2019-12-20
3. Bibliography;Sorting;2011-10-26
4. Optimal sampling strategies for quicksort;Random Structures and Algorithms;1995-12
5. A Fast Radix Sort;The Computer Journal;1992-12-01