Combinatorica

, Volume 3, Issue 1, pp 1–19

Sorting inc logn parallel steps

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

DOI: 10.1007/BF02579338

Cite this article as:
Ajtai, M., Komlós, J. & Szemerédi, E. Combinatorica (1983) 3: 1. doi:10.1007/BF02579338

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 registersRj(i), andRk(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

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