Algorithm that merges two $n$ sorted lists require $2n-1$ comparisons

227 Views Asked by At

How can I write an adversary argument to prove that to prove that any comparison-based algorithm that merges two n-element sorted lists into a single sorted list requires at least $2n-1$ comparisons in its worst-case run?