A simple linear-time algorithm for in situ merging
Information Processing Letters
Simplified stable merging tasks
Journal of Algorithms
Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Asymptotically efficient in-place merging
Theoretical Computer Science
A simple algorithm for in-place merging
Information Processing Letters
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
A Simple Algorithm for Stable Minimum Storage Merging
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A simple algorithm for in-place merging
Information Processing Letters
Theoretical Computer Science
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Ratio based stable in-place merging
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Sorting by merging or merging by sorting?
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On optimal and efficient in place merging
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 5.23 |
In 2000, Geffert et al. (Theoret. Comput. Sci. 237 (2000) 159) presented an asymptotically efficient algorithm for stable merging in constant extra space. The algorithm requires at most m1(t + 1) + m2/2t + o(m1) comparisons (t = ⌊log2(m2/m1)⌋) and 5m2 + 12m1 + o(m1) moves, where m1 and m2 are the sizes of two ordered sublists to be merged, and m1 ≤ m2. This paper optimizes the algorithm. The optimized algorithm is simpler than their algorithm, and makes at most m1(t + 1) + m2/2t + o(m1 + m2) comparisons and 6m2 + 7m1 + o(m1 + m2) moves.