14. Suppose there are n=2^k teams in an elimination tournament, where there are n/2 games in the first round, with the 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.
So the recurrence relation would be f(n)=f(n/2)+1, with n=2^k. Not sure if thats right, seems a little too easy.
16. Solve the recurrence relation for the number of rounds in the tournament described in Exercise 14.
f(n)=f(1)+ n. (Theorem 1) Since f(1)=0; (no rounds when there is a winner) and b=2 and c=1. then the answer is log n. did i do this right?
22. Suppose that the function f satisfies the recurrence relation f(n)=2f( )+logn whenever n is a perfect square greater than 1 and f(2)=1
a. find f(16)...I got 12
b. Find a big-o estimate for f(n). (make the substitution m=logn)
I'm lost on this one. Don't even know how to start.