A multiway merge sorting network |
| |
| Authors: | De-Lei Lee Batcher KE |
| |
| Affiliation: | Dept. of Comput. Sci., York Univ., North York, Ont.; |
| |
| Abstract: | A multiway merge sorting network is presented, which generalizes the technique used in the odd-even merge sorting network. The merging network described here is composed of m k-way mergers and a combining network. It arranges k ordered lists of length n each into one ordered lists in T(k)+log2k] log2m] log2m] steps, where T(k) is the number of steps needed to sort k keys in order; and k and m are any integers no longer restricted to 2 |
| |
| Keywords: | |
|
|
