算法导论(第三版)参考答案:练习4.3-1,练习4.3-2,练习4.3-3,练习4.3-4,练习4.3-5,练习4.3-6,练习4.3-7,练习4.3-8,练习4.3-9
Exercise 4.3-1
Show that the solution of T(n)=T(n−1)+n is O(n2)
(证明对某个恰当的常数 c ,
T(n)≤c(n−1)2+n=cn2−2cn+c+n
令 c=1 ,有
n2−2n+1+n=n2−n+1≤n2 for n≥1
Exercise 4.3-2
Show that the solution of T(n)=T(⌈n/2⌉)+1 is O(lgn)
证明: T(n)≤clg(n−2)≤clgn
假设有 T(⌈n/2⌉)≤clg(⌈n/2⌉−2) ,则
T(n)≤clg(⌈n/2⌉−2)+1≤clg(n/2+1−2)+1≤clg((n−2)/2)+1≤clg(n−2)−clg2+1≤clg(n−2)
只要 c≥1 ,此式成立。
## Exercise 4.3-3
We saw that the solution of T(n)=2T(⌊n/2⌋)+n is O(nlgn) . Show that the solution of this recurrence is also Ω(nlgn) . Conclude that the solution is Θ(nlgn) .
证明 T(n)≥c(n+2)lg(n+2)≥cnlgn ,则
T(n)≥2c(⌊n/2⌋+2)(lg(⌊n/2⌋+2)+n≥2c(n/2−1+2)(lg(n/2−1+2)+n≥2cn+22lgn+22+n≥c(n+2)lg(n+2)−c(n+2)lg2+n≥c(n+2)lg(n+2)+(1−c)n−2cfor n≥2c