What is the correct answer?


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

Correct Answer :

D. m+n-1

Related Questions

The term push and pop is related to the Which of the following is not a limitation of binary search algorithm? Which of the following is two way list? When new data are to be inserted into a data structure, but there is no… The complexity of Bubble sort algorithm is The elements of an array are stored successively in memory cells because Which data structure is used in breadth first search of a graph to hold… Binary search algorithm can not be applied to ______ is very useful in situation when data have to stored and then retrieved… Arrays are best data structures Merge sort uses ? Linked lists are best suited Which of the following is non-liner data structure? To represent hierarchical relationship between elements, Which data structure… Each data item in a record may be a group item composed of sub-items;… Which of the following is not the part of ADT description? The memory address of the first element of an array is called Which one of the following permutations can be obtained the output using… A ______ is a data structure that organizes data similar to a line in… Inserting an item into the stack when stack is not full is called _______… Two main measures for the efficiency of an algorithm are Herder node is used as sentinel in ____ Which of the following data structure cant store the non-homogeneous data… The complexity of merge sort algorithm is Two dimensional arrays are also called Given two sorted lists of size m and n respectively.The number of comparisons… For an algorithm the complexity of the average case is The difference between linear array and a record is A binary search tree whose left subtree and right subtree differ in hight… Which of the following statement is false?