Merging by Decomposition Revisited
S. DvoRak · The Computer Journal · 1988
This paper presents some modifications of stable merging by decomposition (referred to as DM here). The changes made reduce the time requirements considerably. Furthermore, a O(1)-space version of merging is described. The modifications of DM resemble improvements to the original Quicksort method for sorting, since both the algorithms are of the same generic scheme.