算法导论课件3.pdfVIP

BeihangSoft.cn BeihangSoft.cn 3 Growth of Functions 2 2 Θ(nlgn) beats Θ(n )? How’s 100nlgn vs 3n (n = 2) ? 2 We say n →∞, merge sort, Θ(nlgn), beats insertion sort, Θ(n ). Overview  A way to describe behavior of functions in the limit. We’re studying asymptotic efficiency. （函数的渐近效率，即极限情况下的函数行为）  Describe growth of functions （函数增长率的描述）  Focus on what’s important by abstracting away low-order terms and constant factors. （通常忽略低阶项和常数因子）  How we indicate running times of algorithms. （如何描述算法的运算时 间）  A way to compare “sizes” of funcitons （比较函数大小的方法） o  ; O   ;   = ;    ;   2 BeihangSoft.cn 3.1 Asymptotic notation  the asymptotic running time are defined in terms of functions whose domains are the set of natural numbers N = {0,1,2 …}. （运行时间函数的定义域为自 然数集）  Abuse(“滥用，泛用”)  just for convenient  for example, extended to the real numbers domain  Not misused(误用、错用)  We need understand the precise meaning of the notation when it is abused. It is not misused. 3 BeihangSoft.cn 3.1.1 Θ-notation: asymptotically tight bound （渐近紧界） 2  What this notation T(n)= Θ(n ) means For a given function g(n), we denote by Θ(g(n)) the set of functions Θ(g(n)) = {f (n): there exist positive constants c , c , and n such that 1 2 0 0 ≤c g(n) ≤f (n) ≤c g(n) for all n ≥n }. 1 2 0 We could write “f (n) ∈Θ(g(n))” to indicate that f (n) is a member of Θ(g(