# Kenneth Rosen Edition 7th Exercise 8.3 Question 10 (Page No. 535)

25 views
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$ Use Master Theorem with  $a = 1, b = 2, c = 1, d = 0.$

Since $a = b^{ d} ,(d=log_{a}b)$

we know that f(n) is   $O(n^{ d} log n) = O(log n).$

edited

## Related questions

1
259 views
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
Suppose that there are $n = 2^{k}$ teams in an elimination tournament, where there are $\frac{n}{2}$ games in the first round, with the $\frac{n}{2} = 2^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$