We give a sorting network withcn logn comparisons. The algorithm can be performed inc logn parallel steps as well, where in a parallel step we comparen/2 disjoint pairs. In thei-th step of the algorithm we compare the contents of registersR j(i) , andR k(i) , wherej(i), k(i) are absolute constants then change their contents or not according to the result of the comparison.
AMS subject classification (1980)68 E 05
Unable to display preview. Download preview PDF.
- O. Gabber andZ. Galil, Explicit constructions of linear size superconcentrators,Proc. 20st Annual Symposium on Foundations of Computer Science (1979).Google Scholar
- D. E. Knuth,The art of computer programming Volume 3, Sorting and Searching, Addison—Wesley (1973).Google Scholar
- G. A. Margulis, Effective construction of expander graphs (in Russian),Probl. Pered. Inf. 9 (4), 71–80.Google Scholar