Question: 1.1 For which case(s) does Binary Search use (log n) comparisons Multiple answers: Multiple answers are accepted for this question Select one or more answers
1.1
For which case(s) does Binary Search use (log n) comparisons Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation...SHOW MORE
a Best Case
b Average Case
c Worst Case
1.2
Which best describes the recurrence for the worst case of Binary Search, if we recognize that at each iteration we may do two comparisons (one to test for equality,and one to determine less than or greater than) Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer.
a T(n) = T(n-1) + 1
b T(n) = T(n-1) + 2
c T(n) = T(n/2) + 1
d T(n) = T(n/2) + 2
e T(n) = 2T(n/2) + 1
f T(n) = 2T(n/2) + 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
