A modulo merge sorting network

Abstract

The odd-even merge is a widely used and generally accepted merging network that uses O(N log/sup 2/N) comparators with O(log/sup 2/N) delay. A novel merging network is presented that generalizes the technique used in the odd-even merge. It is based on the division of the input keys by a specified modulus, not limited to 2. A special comparator is used in the final merge step that accepts m input lines and produces m sorted items, where m is the modulus selected for the merge. Alternatives are discussed that apply to the bitonic merging network.<>