5 years ago in Data Structure

# Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

[A] mn
[B] max(m,n)
[C] min(m,n)
[D] m+n-1

## Overall Stats

Attempted 413
Correct 58
Incorrect 123
Viewed 232

Serkie Mekonnen - 1 week ago

Serkie Mekonnen from Dessie, Ethiopia is saying mn is correct answer

Narender Kumar - 2 weeks ago

Narender Kumar is saying mn is correct answer

Marem Husen - 1 month ago

Marem Husen from Al Musayyib, Iraq is saying m+n-1 is correct answer

Uga Balu - 1 month ago

Uga Balu from Chennai, India is saying max(m,n) is correct answer

uma - 1 month ago

uma from Hindupur, India is saying m+n-1 is correct answer

## Related Questions

### Which of the following algorithm design technique is used in the quick sort algorithm?

• [A] Dynamic programming
• [B] Backtracking
• [C] Divide and conquer
• [D] Greedy method

• [A] 11
• [B] 12
• [C] 13
• [D] 14

• [A] 3
• [B] 9
• [C] 7
• [D] 5

### The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

• [A] 2 deletions and 3 additions
• [B] 3 additions and 2 deletions
• [C] 3 deletions and 3 additions
• [D] 3 deletions and 4 additions

### Linked list are not suitable data structure of which one of the following problems ?

• [A] Insertion sort
• [B] Binary search