☑Kizspy.me
(Choose 1 answer)
(See picture)
☐ A
A. a 1; b 1
B. a 2; b=1
☐ D
C. a= 1; b=2
☐ E
D. None of the other choices is correct
E. a = 0; b=0
Back
Next
FUO.sh
sh the exam.
Let f(n) represent the number of comparisons made by the binary
search algorithm on a sequence of size n. The recurrence relation
for f(n) is given by:
n
f(n) = =
af (7) + b,
when n is even. Find the values of a and b.
