Prove that merging two sorted arrays of N items requires at least 2N 1 comparisons.You
Chapter 7, Problem 7.36(choose chapter or problem)
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 andfrom different lists, then they must be compared.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer