Davinder Singh
Davinder Singh - 4 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...

Overall Stats

Attempted 374
Correct 46
Incorrect 105
Viewed 223

Answers

Guest
Guest
Mital Patel
Mital Patel - 1 month ago

Mital Patel from Ahmedabad, India is saying mn is correct answer

Jawad Awan
Jawad Awan - 7 months ago

Jawad Awan from Jamshoro, Pakistan is saying mn is correct answer

Mayank Pathak
Mayank Pathak - 8 months ago

Mayank Pathak from Muzaffarpur, India is saying m+n-1 is correct answer

akanksha singh
akanksha singh - 8 months ago

akanksha singh from Vadodara, India is saying mn is correct answer

monika
monika - 8 months ago

monika from India is saying m+n-1 is correct answer

Related Questions

Davinder Singh
Davinder Singh - 4 years ago in Data Structure
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
Davinder Singh
Davinder Singh - 4 years ago in Data Structure
Merge sort uses ?
  • [A] Divide and conquer strategy
  • [B] Backtracking approach
  • [C] Heuristic search
  • [D] Greedy approach