Question

Number of comparisons required for an unsuccessful search of an element in a sequential search, organized, fixed length, symbol table of length l is

Answer 1

Explanation:

time complexity or O(n) of Binary search is log n (base 2) as the "domain" halves after each comparison, so if you half a million 21 times you will reach 1 answer which will be the number you need. example: for 4 numbers in a binary search we will need at most 3 i.e log 4(base 2) + 1 =34