0 votes 0 votes Can anyone help me to understand this problem….?? Algorithms merge-sort algorithms sorting merging + – Vikas123 asked Jan 8, 2019 Vikas123 1.0k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply kumar.dilip commented Jan 8, 2019 reply Follow Share Try to type the question. You have to choose false here. 0 votes 0 votes Vikas123 commented Jan 8, 2019 reply Follow Share 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 0 votes 0 votes adarsh_1997 commented Jan 8, 2019 reply Follow Share @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 0 votes 0 votes kumar.dilip commented Jan 8, 2019 reply Follow Share Question talking about the merge procedure not merge sort. Time will be O(n+m). 0 votes 0 votes Vikas123 commented Jan 8, 2019 reply Follow Share ohhh silly mistake was done.... @kumar.dilip and @adarsh_1997 thanx bro 0 votes 0 votes arya_stark commented Jan 9, 2019 reply Follow Share Brother just see option (B) and (D). You have to read complete question first. 0 votes 0 votes patrica commented Feb 12, 2019 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.