## Categories and Subject Descriptors: F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems

### BibTeX

@MISC{_categoriesand,

author = {},

title = {Categories and Subject Descriptors: F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems},

year = {}

}

### OpenURL

### 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.

### Citations

8530 |
Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...irst and second position, respectively, we only need to inspect n1n2 buckets. For ASCII-text this number is typically much smaller than the total 65 536 buckets. 4. FORWARD RADIXSORT Several authors [=-=Cormen et al. 1990-=-; Kingston 1990; Mehlhorn 1984] have pointed out that MSD radixsort has a bad worst-case performance due to fragmentation ofs6 \DeltasA. Andersson and S. Nilsson the data into many small sublists. In ... |

617 |
Text Compression
- Bell, Cleary, et al.
- 1990
(Show Context)
Citation Context ...ket scheme. To get more realistic timings we have chosen to use samples of real text. Experiments were performed on a collection of standard texts from the Calgary/Canterbury text compression corpus [=-=Bell et al. 1990-=-]. We used all text files within this corpus and each line of the input constitutes one key. The average length of a line is about 40 characters in the texts. Since all of these files are relatively s... |

147 | Fast algorithms for sorting and searching strings
- Bentley, Sedgewick
- 1997
(Show Context)
Citation Context ... encountered, to reduce the number of buckets thatsImplementing Radixsort \Deltas3 needs to be inspected. This typically works well for text files in ASCII format. Another recently proposed solution [=-=Bentley and Sedgewick 1997-=-], is to replace bucket sort by a comparison-based method. The algorithm is presented as a variation of quicksort, where the string comparisons have been replaced by appropriate character comparisons.... |

30 | A new efficient radix sort
- Andersson, Nilsson
- 1994
(Show Context)
Citation Context ... typical data. In this article we show that it is possible to implement radix sorting in such a way as to guarantee also good worst-case behavior. This is achieved by an algorithm, Forward radixsort [=-=Andersson and Nilsson 1994-=-], that combines the advantages of traditional LSD and MSD radixsort. Before going into details we formally state the problem and our theoretical model of computation. Let \Sigmas= f1; 2; : : : ; mg b... |

14 | Engineering radix sort
- McIlroy, Bostic
- 1993
(Show Context)
Citation Context ...rs of the input or use an inordinate amount of extra time or space. However, with a careful implementation efficient implementations are possible as has been shown by several researchers [Davis 1992; =-=McIlroy et al. 1993-=-]. In fact, radix sorting can be implemented to run considerably faster than strictly comparison-based sorting for typical data. In this article we show that it is possible to implement radix sorting ... |

8 | Searching and sorting real numbers - Ehrlich - 1981 |

3 |
A Fast Radix Sort". The computer journal 35
- DAVIS
- 1992
(Show Context)
Citation Context ...the characters of the input or use an inordinate amount of extra time or space. However, with a careful implementation efficient implementations are possible as has been shown by several researchers [=-=Davis 1992-=-; McIlroy et al. 1993]. In fact, radix sorting can be implemented to run considerably faster than strictly comparison-based sorting for typical data. In this article we show that it is possible to imp... |