Merge Sort

Question

Can anyone help me to understand this problem….??

Comments

Try to type the question.

You have to choose false here.

---

c option is also wrong na...

sorted array of size m and n

and applying merge sort  than it take O(nlogn+mlogm).

correct me if i am wrong

---

@Vikas123 bro read the question properly it is asking about merge procedure not merge sort. you know that merge sort contain 3 functions inside it .

mergesort(a,p,r)

{

{if (p<=r)

q=p+r/2;

mergesort(a,p,q);

mergesort(a,q+1,r);

merge(a,p,q,r);// question is specifically asking about tc of this part

{

}

hope this helps

 

---

Question talking about the merge procedure not merge sort.

Time will be O(n+m).

---

ohhh silly mistake was done....

@kumar.dilip and @adarsh_1997

thanx bro

---

Brother just see option (B) and (D).

You have to read complete question first.

---

I recommend you to follow the merge sort article from here. Clear basic concepts first by solving the example program in your favorite code language.