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

0 votes
41 views
Give a big-O estimate for the function $f$ in question $10$ if $f$ is an increasing function.

## Related questions

0 votes
1 answer
1
259 views
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
0 votes
1 answer
2
93 views
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
0 votes
2 answers
3
113 views
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.
0 votes
1 answer
4
140 views
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.$