本文讨论如何有效应用复杂度计算的主定理
快速计算 分治算法的复杂度。
下面给出几个简单的例子:
1. T(n) = T(n/2) + O(n)
f(n) = O(n) > O(1), 并且满足第四种情况,所以复杂度是O(n)
2. T(n) = 2T(n/2) + O(n)
f(n) = O(n) = O(n), so complexity is O(nlgn), satisfying second condition
3. T(n) = 2T(n/2) + O(nlgn)
f(n) satisfies 3rd condition, so complexity is O(nlg2n)