Self Doubt

Question

What is the minimum and maximum number of comparisons required to merge two lists of size m and n ?

Comments

In Best case

example:

List1 12

List2 345678

it needs 2 comparisons==> min(m,n)

example:

list1 123456

list2 78 this needs 6 comparisons but this not the best case

In worst case

List1 1357

List2 2468

it needs 7 comparisons==> m+n-1 

---

bro, they have not given anything about whether the list is sorted or unsorted... hence taking the worst case that the link is unsorted, #comparisons would be O(mlogm+nogn).

---

Yes all the explanation was given for merge routine of merge sort(i.e. for sorted lists)

Answer 1

Minimum = min(m,n)

Mximum= m+n-1

Comments

@ Vipin Rai

why you select this is the best answer?

 Hemanth_13  already explain in the comment section.

please remove, this is not a good answer.

If she explains better than anyone then you can select the best answer.