算法：a03-chap3-f-growth.pptVIP

* * * * 一些文献中用 O-notation 来表示一致紧界。 * 一些文献中用 O-notation 来表示一致紧界。 * * * * * The running time of insertion sort is not Ω(n2). Why? Since there exists an input for which insertion sort runs in Θ(n) time (e. g., the input is already sorted). * * * * * * * * * * * 人类能够观测到的宇宙中的原子总数约为1080 * * BeihangSoft.cn * * 3 Growth of Functions Θ(nlgn) beats Θ(n2)? How’s 100nlgn vs 3n2 (n = 2) ? We say n →∞, merge sort, Θ(nlgn), beats insertion sort, Θ(n2). 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（比较函数大小的方法） * 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.1.1 Θ-notation: asymptotically tight bound（渐近紧界） What this notation T(n)=Θ(n2) means For a given function g(n), we denote by Θ(g(n)) the set of functions Θ(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 could write “f(n)∈Θ(g(n))” to indicate that f(n) is a member of Θ(g(n)). Instead, we will usually write “f(n)=Θ(g(n))” to express the same notion. The abuse may at first appear confusing, but it has advantages. * T(n)=Θ(n2) For a given function g(n), we denote by Θ(g(n)) the set of functions Θ(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 say that g(n) is an asymptotically tight bound for f(n). 3.1.1 Θ-notation: asymptoticall