Question: Consider a binary search in an array of 100 000 sorted entries a) What is the maximum number of comparisons that need to be

Consider a binary search in an array of 100 000 sorted entries a) What is the maximum number of comparisons

Consider a binary search in an array of 100 000 sorted entries a) What is the maximum number of comparisons that need to be made to find an entry? (2) b) What is the minimum number of comparisons that need to be made to find an entry? (2) c) What is the upper bound on this search algorithm? Use asymptotic notation in your answer and give the English name for the dominance relation (2) d) What is the lower bound on this search algorithm? Use asymptotic notation in your answer and give the English name for the dominance relation (2)

Step by Step Solution

3.49 Rating (152 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a The maximum number of comparisons in a binary search is determined by the for... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!