Sorting in linear time?

Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1995 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95  
We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O. . 2W -1 in O (n log log n) time, for arbitrary w z log n, a significant improvement over the bound of O (n-) achieved by the fusion trees of Fredman and Willard. Provided that w 2 (log n)z+', for some fixed e > 0, the sorting can even be accomplished in linear expected time with a randomized algorithm. Both of our algorithms parallelize without loss on a unitcost PRAM with a word length of w bits. The
more » ... irst one yields an algorithm that uses O (log n) time and O (n log log n) operations on a deterministic CRCW PRAM. The second one yields an algorithm that uses O(log n) expected time and O(n) expected operations on a randomized EREW PRAM, provided that w 2 (log n)2+' for some fixed c >0. Our deterministic and randomized sequential and parallel algorithms generalize to the lexicographic sorting problem of sorting multiple-precision integers represented in several words. Introduction Sorting is one of the most fundamental computational problems, and n keys can be sorted in O(n log n) time by any of a number of "well-known sorting algorithms. These algorithms operate in the comparison-based setting, i.e., they obtain information about the relative order of keys exclusively through pairwise comparisons. It is easy to show that a running time of O (n log n) is optimal in the comparison-based model. However, this model may not always be the most natural one for the study of sorting problems, since real machines allow many other operations besides comparison. Using indirect addressing, for instance, it is possible to sort n
doi:10.1145/225058.225173 dblp:conf/stoc/AnderssonHNR95 fatcat:5pl4yf3zi5fq7j5omkeki7kmbi