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?
Loading...
Overall Stats
Attempted
279
Correct
34
Incorrect
80
Viewed
165
Answers
Pkchandiya Brahman -
2 months ago
Pkchandiya Brahman from Larkana, Pakistan is saying m+n-1 is correct answer
Cécile Musabyemariya -
4 months ago
Cécile Musabyemariya is saying max(m,n) is correct answer
Shourya Singh Rawat -
4 years ago
Shourya Singh Rawat from India is saying max(m,n) is correct answer
Lets Know -
4 years ago
Lets Know from Pakistan is saying mn is correct answer
Baerov Bogdan -
4 years ago
Baerov Bogdan from Mogosoaia, Romania is saying max(m,n) is correct answer
Related Questions
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
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.
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