专题2算法描述及解析.pptVIP

* 指数时间算法只有在n取值非常小时才实用。 当数据集的规模（即n的取值）很大时，在现代计算机上运行具有比O（nlogn）复杂度还高的算法往往是很困难的。尤其是指数时间算法。 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Mathematical induction now requires us to show that our solution holds for the boundary conditions. Typically, the boundary conditions are suitable as base cases for the inductive proof. This requirement can sometimes lead to problems. Assume that T(1) = 1 is the sole boundary condition of the recurrence. Then, we can‘t choose c large enough, since T(1)≤c 1 lg 1 = 0, which is at odds with T(1)=1. The case of our inductive proof fails to hold.（递归结果与初始情况矛盾，即递归证明失败？） 4.1 The substitution method * An inductive hypothesis inconsistent with specific boundary condition, How to overcome the difficulty? （如何克服递归结果与边界条件不一致的问题？） asymptotic notation only requires us to prove T(n)≤cnlg n for n≥ n0, where n0 is a constant. to remove the difficult boundary condition T(1) = 1 Impose T(2) and T(3) as boundary conditions for the inductive proof. From the recurrence, we derive T(2) = 4 and T(3) = 5. The inductive proof that T(n)≤cn lg n can now be completed by choosing any c≥2 so that T(2)≤c2 lg 2 and T(3)≤c 3 lg 3. To extend boundary conditions * Unfortunately, there is no general way to guess the correct solutions to recurrences. (猜想不是一种方法) Guessing a solution takes experience and, occasionally, creativity. ( why we study the course? It’s a training for us to get experience, to catch occasion, to have creativity. ) Fortunately, though, there are some heuristics (recursion tress) that can help you become a good guesser. 4.1.1 Making a good guess * If a recurrence is similar to one you have seen before, then guessing a similar solution is reasonable. For example, which looks difficult because of the added “17”. Intuitively, this additional term cannot substantially affect the solution to the recurrence.（该附加项不会从本质上影响递归解） When n is large, the difference between T( n/2 ) and T( n/2 + 17) is not that large. Consequently, we mak