计算机算法导论_第5章.pptVIP

* Permuting in place Introduction to Algorithms 计算机算法导论 2007~2008年第一学期 * 下周五的实验课改在5月4日 * Quiz Solve the following recurrences(provide only the θ() bounds). You can assume T(n)=1 for n smaller than some constant in all cases. You should write the solutions and provide justifications.(20 min) T(n) = T(n/7)+1 T(n) = 10T(n/3)+n1.1 T(n) = T(n-2) + lgn * Answer 1、T(n) = T(n/7)+1 Answer: T (n) = Θ(lg n) Master’s Theorem, case 2 2、T(n) = 10T(n/3)+n1.1 Answer: T (n) = Θ (nlog310) Master’s Theorem, case 1 * Answer 3、T(n) = T(n-2) + lgn Probabilistic Analysis  Randomized Algorithm * 5.