Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
In Proc. 35th Annual IEEE Symposium on Foundationsof Computer Science, pages 714721. IEEE Computer Society Press, 1994.
 

Summary: In Proc. 35th Annual IEEE Symposium on
Foundationsof Computer Science, pages 714­721. IEEE Computer Society Press, 1994.
A New Efficient Radix Sort
Arne Andersson Stefan Nilsson
Department of Computer Science Department of Computer Science
Lund University Lund University
Box 118, S­221 00 Lund, Sweden Box 118, S­221 00 Lund, Sweden
email: arne@dna.lth.se email: stefan@dna.lth.se
Abstract
We present new improved algorithms for the sorting
problem. The algorithms are not only efficient but
also clear and simple. First, we introduce Forward
Radix Sort which combines the advantages of tradi­
tional left­to­right and right­to­left radix sort in a sim­
ple manner. We argue that this algorithm will work
very well in practice. Adding a preprocessing step, we
obtain an algorithm with attractive theoretical prop­
erties. For example, n binary strings can be sorted in
\Theta
i

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences