7 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
Loading...
Next Question

Create your Digital Resume For FREE on your name's sub domain "yourname.wcard.io". Register Here!


Overall Stats

Attempted 426
Correct 61
Incorrect 125
Viewed 240

Answers

Guest
Guest
Kar Kuzhali
Kar Kuzhali - 1 month ago

Kar Kuzhali is saying max(m,n) is correct answer

DZ&UC N.Feroze
DZ&UC N.Feroze - 2 months ago

DZ&UC N.Feroze from Karachi, Pakistan is saying max(m,n) is correct answer

Abdul Majid
Abdul Majid - 4 months ago

Abdul Majid from Pakistan is saying m+n-1 is correct answer

Bert Chen
Bert Chen - 9 months ago

Bert Chen is saying m+n-1 is correct answer

Sanju Rebel
Sanju Rebel - 1 year ago

Sanju Rebel from Hyderabad, India is saying m+n-1 is correct answer

Related Questions

Queue can be used to implement ?

  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort