Engineering Radix Sort

Engineering Radix Sort (1993)

by Peter M. McIlroy , Keith Bostic , M. Douglas McIlroy

Venue:	COMPUTING SYSTEMS
Citations:	13 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Engineering Radix Sort	user correction - Legacy Corrections
AUTHOR NAME	Peter McIlroy	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Research Group; University of California at Berkeley	user correction - Legacy Corrections
AUTHOR NAME	Keith Bostic	user correction - Legacy Corrections
AUTHOR AFFIL	Computer Science Research Group; University of California at Berkeley	user correction - Legacy Corrections
AUTHOR NAME	M. Douglas Mcilroy	user correction - Legacy Corrections
AUTHOR AFFIL	AT&T Bell Laboratories	user correction - Legacy Corrections
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.	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	Computing Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	5--27	INFERENCE
VOLUME	6	INFERENCE
CITATIONS	13 found	ParsCit 1.0