398 views

1 Answer

1 votes
1 votes

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 by

Related questions

1.3k
views
1 answers
0 votes
admin asked May 9, 2020
1,288 views
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
558
views
1 answers
0 votes
admin asked May 9, 2020
558 views
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
1.9k
views
2 answers
0 votes
admin asked May 9, 2020
1,886 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 pl...
562
views
1 answers
0 votes
admin asked May 9, 2020
562 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.$