adplus-dvertising
frame-decoration

Question

For merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of

a.

O(m)

b.

O(n)

c.

O(m+n)

d.

O(log(m) + log(n))

Answer: (c).O(m+n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. For merging two sorted lists of sizes m and n into a sorted list of size m + n, we require comparisons of

Similar Questions

Discover Related MCQs

Q. Which of the following algorithm design technique is used in the quick sort algorithm?

Q. The average search time of hashing, with linear probing will be less if the load factor

Q. Heap allocation is required for languages

Q. A character of the data that binary search uses but the linear search ignores, is

Q. Which of the following is useful in implementing quick sort?

Q. A________search begins the search with the element that is located in the middle of the array.

Q. The time complexity of linear search algorithm over an array of n elements is

Q. Which of the following algorithms exhibits the unnatural behavior that, minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and maximum number of comparisons are needed if they are already in sorted order?

Q. Which of the following sorting algorithm has the worst time complexity of n log(n)?

Q. Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

Q. The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

Q. Which of the following is false ?

Q. A search begins the search with the element that is located in the middle of the array

Q. To sort many large object or structures, it would be most efficient to

Q. Average successful search time for sequential search on 'n' items is

Q. Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requires only about n comparisons to find the location of an item in the DATA array, then n is

Q. Which of the following sorting procedure is the slowest ?

Q. Which of the following sorting method is stable ?

Q. Which of the following best describes sorting ?

Q. A sort which compares adjacent elements in a list and switches where necessary is