Advertisement

Combinatorica

, Volume 3, Issue 1, pp 1–19 | Cite as

Sorting inc logn parallel steps

  • M. Ajtai
  • J. Komlós
  • E. Szemerédi
Article

Abstract

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    O. Gabber andZ. Galil, Explicit constructions of linear size superconcentrators,Proc. 20st Annual Symposium on Foundations of Computer Science (1979).Google Scholar
  2. [2]
    D. E. Knuth,The art of computer programming Volume 3, Sorting and Searching, Addison—Wesley (1973).Google Scholar
  3. [3]
    G. A. Margulis, Effective construction of expander graphs (in Russian),Probl. Pered. Inf. 9 (4), 71–80.Google Scholar

Copyright information

© Akadémiai Kiadó 1983

Authors and Affiliations

  • M. Ajtai
    • 1
  • J. Komlós
    • 1
  • E. Szemerédi
    • 1
  1. 1.Mathematical Institute of the Hungarian Academy of SciencesBudapestHungary

Personalised recommendations