Article

Algorithmica

, Volume 5, Issue 1, pp 75-92

First online:

Improved sorting networks withO(logN) depth

  • M. S. PatersonAffiliated withDepartment of Computer Science, University of Warwick

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The sorting network described by Ajtaiet al. was the first to achieve a depth ofO(logn). The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development.

Key words

Sorting networks Comparators Parallel algorithm