摘要: This paper presented a new fast parallel merging algorithm, the Doudirun Merging Algorith, DDMA. It is developed by means of the duodirun structure. When two sorted arrays with a total length N are merged, log N passes for comparison and 2 log N passes for transportation are required. The algorithm exhibits many superior global properties in simplicity, regularity, symmetry, generality and so on.