adplus-dvertising
frame-decoration

Question

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

a.

[log2n]-1

b.

[logn]+1

c.

[log2n]

d.

[log2n]+1

Answer: (d).[log2n]+1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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 :

Q. You have to sort a list L consisting of a sorted list followed by a few “random” elements. Which of the following sorting methods would be especially suitable for such a task?

Q. A technique for direct search is

Q. The searching technique that takes O (1) time to find a data is

Q. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is

Q. In worst case Quick Sort has order

Q. A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

Q. Which of the following sorting algorithms does not have a worst case running time of O (n^2) ?

Q. The quick sort algorithm exploit _________ design technique.

Q. The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is

Q. The complexity of searching an element from a set of n elements using Binary search algorithm is

Q. Which of the following sorting methods would be most suitable for sorting a list which is almost sorted

Q. Quick sort is also known as

Q. The goal of hashing is to produce a search that takes

Q. The best average behaviour is shown by