, Volume 3, Issue 1, pp 1-19

Sorting inc logn parallel steps

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.