1 votes 1 votes How many maximum and minimum element comparisons are required to merge 2 sorted arrays of n and m elements into a single sorted array using merge sort procedure? Sambhrant Maurya asked Aug 5, 2018 Sambhrant Maurya 579 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Siddharth Bhardawaj commented Aug 12, 2018 reply Follow Share Sorry , it was my mistake that I have written max(m,n). I dont know how I made such silly mistake while writing.... Answer is O(min(m,n)).... And thanks for pointing out my mistake...:) 1 votes 1 votes Siddharth Bhardawaj commented Aug 12, 2018 reply Follow Share Check @MiNipanda comments......he has explained briefly with an example.....you will definitely get that.... 0 votes 0 votes Mohamadali commented Oct 14, 2020 reply Follow Share Suppose elements in 1st sub array is {1,2,3} with length m=3 and another sub array is {4,5} with length n=2. Then 1 is compared with 4. Then 1 is inserted into the merged list. 2 is then compared with 4. Then 2 is inserted into the merged list. 3 is then compared with 4. Then 3 is inserted into the merged list. Then nothing else is left in 1st subarray to be compared. We just copy down the whole 2nd subarray. So min(m,n)=min(3,2) is not correct! Generally, minimum element comparisons are required to merge is max(m,n). 0 votes 0 votes Please log in or register to add a comment.
