Question

3) The number of comparison in binary search are........ .......of linear search.
i) Less than
ii) Equal to
iii) Greater than iv) None of these
​

Answer 1

the number of comparision in binary search are less than of linear search

Answer 2

i. less than

A linear search, often known as a consecutive search, is a technique for locating an item in a list. It evaluates every item in the list one by one as a match is discovered or the entire list is searched.

In linear search, the best case  scenario is O(1) for the initial element (1). In binary search, however, it is for the middle number, i.e., O. (1). The worst case scenario for seeking an element in a linear search is N number of queries. For binary search, on the other hand, the number of comparisons is ㏒2N.