Question: The analysis of binary search in this chapter assumed that the size was always 2k 1 for some value of k. For this question, we

The analysis of binary search in this chapter assumed that the size was always 2k 1 for some value of k. For this question, we will explore other possibilities for the size:

a. What is the worst case when N ≠ 2k 1?

b. What is the average case when N ≠ 2k 1, assuming that the key is in the list? Hint: Think about what this change in size means for the bottom of the search tree.

c. What is the average case when N ≠ 2k 1, if the key might not be in the list? Hint: Think about what this change in size means for the bottom of the search tree.

Step by Step Solution

3.48 Rating (164 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The question is complete so lets proceed to answer each part systematically a Worst Case when N eq 2k 1 In binary search the worstcase time complexity ... 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 Databases Questions!