A Vertical and Horizontal Multiway Algorithm for Parallel-Merging

Based on the sloping-and-shaking k-way merging and sorting algorithm, a vertical and horizontal multiway algorithm for parallel-merging is proposed, which is different from these methods which apply recursive two-way to merge. The algorithm is a sort of brand-new multiway merge sorting algorithm, whose main characteristic is to sort directly the m×k matrix (m, k is a random integer) and not to rely on recursively the two-way merge process. Compared with the sloping-and-shaking k-way merging and sorting algorithm and high efficiency multiway parallel merging algorithm, while k is big in three small in forty, the time complexity of the algorithm is lower than the uniformity algorithm. In the meantime, the design complexity realized in the special hardware of the algorithm has obvious advantage.