A novel algorithm achieving the minimum number of comparisons M(2, n) needed to merge (2, n) elements is presented in this paper. A geometric presentation of the problem is used to obtain an easily implemented algorithm that achieves the bound for all values of n. The algorithm provides a new simple induction proof for M(2, n).