Improving the bounds on optimal merging

This paper presents a new merging algorithm and uses a counterstrategy argument to derive new upper and lower bounds on the complexity of the optimal merging problem. These improved bounds differ by at most ⌈ m/4 ⌉ comparisons, where m is the number of elements of the shorter sequence.