Affiliation:
1. Lund Univ.
2. Helsinki Institute of Technology
Abstract
We present and evaluate several optimization and implementation techniques for string sorting. In particular, we study a recently published radix sorting algorithm, Forward radixsort, that has a provably good worst-case behavior. Our experimental results indicate that radix sorting is considerably faster (often more than twice as fast) than comparison-based sorting methods. This is true even for small input sequences. We also show that it is possible to implement a radixsort with good worst-case running time without sacrificing average-case performance. Our implementations are competitive with the best previously published string sorting programs.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference16 articles.
1. A new efficient radix sort
2. BELL T. C. CLEARY J. G. AND WITTEN I. H. 1990. Text Compression. Prentice Hall. BELL T. C. CLEARY J. G. AND WITTEN I. H. 1990. Text Compression . Prentice Hall.
3. Engineering a sort function
4. CORMEN T. H. LEISERSON C. E. AND RIVEST R. L. 1990. Introduction to Algorithms. McGraw-Hill. CORMEN T. H. LEISERSON C. E. AND RIVEST R. L. 1990. Introduction to Algorithms . McGraw-Hill.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A sorting algorithm based on ordered block insertions;Journal of Computational Science;2022-10
2. Efficient String Sort with Multi-Character Encoding and Adaptive Sampling;Proceedings of the 2021 International Conference on Management of Data;2021-06-09
3. String Sorting;Encyclopedia of Algorithms;2016
4. Engineering Parallel String Sorting;Algorithmica;2015-09-18
5. String Sorting;Encyclopedia of Algorithms;2015