Engineering radix sort (1993) [11 citations — 0 self]
by Peter M. Mcilroy, Keith Bostic, M. Douglas Mcilroy
Computing Systems
http://www.bostic.com/radix.paper.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Mcilroy93engineeringradix,author = {Peter M. Mcilroy and Keith Bostic and M. Douglas Mcilroy},
title = {Engineering radix sort},
journal = {Computing Systems},
year = {1993},
volume = {6},
pages = {5--27}
}
Years of Citing Articles
Abstract:
Radix sorting methods have excellent asymptotic performance on string data, for which comparison is not a unit-time operation. Attractive for use in large byteaddressable memories, these methods have nevertheless long been eclipsed by more easily programmed algorithms. Three ways to sort strings by bytes left to right---a stable list sort, a stable two-array sort, and an in-place "American flag " sort---are illustrated with practical C programs. For heavy-duty sorting, all three perform comparably, usually running at least twice as fast as a good quicksort. We recommend American flag sort for general use. 1.
Citations
| 2005 | The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974 |
| 260 | Three partition refinement algorithms – Paige, Tarjan - 1987 |
| 133 | The Art of Computer – Knuth - 1968 |
| 53 | A Retargetable Compiler for ANSI C – Fraser, Hanson - 1991 |
| 32 | Quicksort,” The – Hoare - 1962 |
| 6 | Theory and practice in the construction of a working sort routine – Linderman - 1984 |
| 4 | Programming Pearls, Addison-Wesley – Bentley - 1986 |
| 2 | Radix exchange---an internal sorting method for digital computers – Hildebrandt, Isbitz - 1959 |
| 2 | The trouble with qsort – Bentley - 1992 |
| 1 | Sorting method and apparatus – McCauley - 1989 |
| 1 | Standard for Information Technology – IEEE - 1991 |
| 1 | Intermediate files and external radix sort – McIlroy |
