Prove that merging two sorted arrays of N items requires at least 2N − 1 comparisons. You must show that if two elements in the merged list are consecutive and from different lists, then they must be compared.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.