Sorting inc logn parallel steps

Abstract

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\r \r j(i)\r , andR\r \r k(i)\r , wherej(i), k(i) are absolute constants then change their contents or not according to the result of the comparison.