adplus-dvertising
frame-decoration

Question

Time required to merge two sorted lists of size m and n, is

a.

Ο(m | n)

b.

Ο(m + n)

c.

Ο(m log n)

d.

Ο(n log m)

Answer: (b).Ο(m + n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Time required to merge two sorted lists of size m and n, is

Similar Questions

Discover Related MCQs

Q. Quick sort algorithm is an example of

Q. Quick sort running time depends on the selection of

Q. Which one of the below is not divide and conquer approach?

Q. Which of the following searching techniques do not require the data to be in sorted form

Q. Which of the below given sorting techniques has highest best-case runtime complexity

Q. How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4} ?

Q. An adaptive sorting algorithm −

Q. The following sorting algorithms maintain two sub-lists, one sorted and one to be sorted −

Q. The worst case complexity of binary search matches with −

Q. The number of comparisons done by sequential search is ………………

Q. In ……………, search start at the beginning of the list and check every element in the list.

Q. State True or False.

i) Binary search is used for searching in a sorted array.

ii) The time complexity of binary search is O(logn).

Q. Which of the following is not the internal sort?

Q. In general, the binary search method needs no more than ……………. comparisons.

Q. The Worst case occur in linear search algorithm when

Q. The Average case occur in linear search algorithm

Q. Which of the following is not the required condition for binary search algorithm?

Q. Which of the following is not a limitation of binary search algorithm?

Q. Binary search algorithm can not be applied to

Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :