《算法导论》第四章-第5节_练习（参考答案）

算法导论（第三版）参考答案：练习4.5-1，练习4.5-2，练习4.5-3，练习4.5-4，练习4.5-5

Exercise 4.5-1

Use the master method to give tight asymptotic bounds for the following recurrences:

1. $T(n) = 2T(n/4) + 1$
2. $T(n) = 2T(n/4) + \sqrt{n}$
3. $T(n) = 2T(n/4) + n$
4. $T(n) = 2T(n/4) + n^2$

1. $a=2, b=4, f(n) =1. \log_{4}2 >0$，满足情况一；解为

   $T(n)=\Theta(n^{\log_4{2}}) = \Theta(\sqrt{n})$

2. $a=2, b=4, f(n) =\sqrt{n}. \log_{4}2 = \frac{1}{2}$，满足情况二；解为 T(n)=Θ(