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

Overall Stats

Attempted 279
Correct 34
Incorrect 80
Viewed 165

Answers

Guest
Guest
Pkchandiya Brahman
Pkchandiya Brahman - 7 months ago

Pkchandiya Brahman from Larkana, Pakistan is saying m+n-1 is correct answer

Cécile Musabyemariya
Cécile Musabyemariya - 9 months ago

Cécile Musabyemariya is saying max(m,n) is correct answer

Shourya Singh Rawat
Shourya Singh Rawat - 4 years ago

Shourya Singh Rawat from India is saying max(m,n) is correct answer

Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying mn is correct answer

Baerov Bogdan
Baerov Bogdan - 4 years ago

Baerov Bogdan from Mogosoaia, Romania is saying max(m,n) is correct answer

Related Questions

Which of the following statement is true ?

  • [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
  • [B] Breath first search cannot be used to find converted components of a graph.
  • [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
  • [D] Depth first search can be used to find connected components of a graph.

Queue can be used to implement ?

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

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

  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation