算法导论第二章函数增长.pptVIP

Ch2 Growth of Functions函数增长 Asymptotic Growth(渐进增长) Asymptotic Growth(渐进增长) Θ-notation渐进紧致界 Θ-notation Example1: n2 / 2 - 3n = Θ(n2) Example2: an3+bn2+cn+d= Θ(n3),a0 Other examples O-notation O-notation Example an3+bn2+cn+d= O(n3),a0 Proof: 前面的例子已经表明an3+bn2+cn+d= Θ(n3),又由于集合Θ(n3)是被O(n3)包含的，所以得到证明 an2+bn+d= O(n3), a0 Example O-notation Ω-notation Ω-notation Example2: an3+bn2+cn+d= Ω(n2),a0 Example: an3+bn2+d= Ω(2n2+3nlogn), a0 Example Note o-notation渐进非紧上界 Example1: 15n=o(nlogn), 2n2+d≠o(n2) ω-notation渐进非紧下界 Example: 2n2+bn+d = ω(n),而3n2 ≠ ω(n2) 渐进关系的传递性transitivity 渐进关系的自反性reflexivity 对称性和置换对称性 Asymptotic Notation in Equations方程中渐进记号 思考题 Page 50, 3.1-2, 3.1-4, 3.1-6, 3.1-7 常见函数 补充定理 模运算modular arithmetic 指数exponentials 对数 logarithms 阶乘和stirling公式 函数迭代functional iteration 对数迭代 费波那契数fibonacci numbers 费波那契数fibonacci numbers 思考题 Page57 3.2-2 3.2-3 3.2-4 3.2-5 上取整和下取整相关公式 * * In the insertion-sort example we discussed that when analyzing algorithms we are --interested in worst-case running time as function of input size n运行时间关于输入规模n的函数 --not interested in exact constants in bound不关心高次项系数 --not interested in lower order terms不关心低次项 A good reason for not caring about constants and lower order terms is that the RAM model is not completely realistic anyway (not all operations cost the same) We want to express rate of growth of standard functions:表达函数的增长率 --the leading term with respect to n（主要项） --ignoring constants in front of it（忽略主要项的系数） k1n + k2 ~ n k2nlogn ~ nlogn k1n2 + k2n + k3 ~ n2 We also want to formalize e.g. that a n log n algorithms is better than a n2 algorithm（形式化） Θ(g(n)) = {f(n): There exist positive constants c1, c2 and n0 such that 0 ≤ c1g(n) ≤f(n) ≤c2g(n) for all n≥n0} --We use Θ-notation to give a tight bound on a function(紧致界) Θ(g(n)) = f(n): 当n?∞时，f(n)和g(n)趋于无穷大的阶是相同的 f(n)和g(n)均是渐进非负的，即对足够大的，f(n)和g(n)均大于等于0 算法计算时间 数量级 The worst case running time of insertion-sort is Θ(n2) --6nlgn + √nlg2n=Θ(nlgn) We