Question

If you have an array of 100 sorted elements, and you search for a value that does not exist in the array using a binary search, approximately how many comparisons will have to be done?
a)7


b)100


c)50

Answer 1

Answer:

50

Explanation:

as binary search will search the array by dividing it into two halves till it find the value.