Sorting inc logn parallel steps

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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    O. Gabber andZ. Galil, Explicit constructions of linear size superconcentrators,Proc. 20st Annual Symposium on Foundations of Computer Science (1979).

  2. [2]

    D. E. Knuth,The art of computer programming Volume 3, Sorting and Searching, Addison—Wesley (1973).

  3. [3]

    G. A. Margulis, Effective construction of expander graphs (in Russian),Probl. Pered. Inf. 9 (4), 71–80.

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ajtai, M., Komlós, J. & Szemerédi, E. Sorting inc logn parallel steps. Combinatorica 3, 1–19 (1983). https://doi.org/10.1007/BF02579338

Download citation

AMS subject classification (1980)

  • 68 E 05