- tight bounds(上界和下界)
Θ ( g ( n ) ) = { f ( n ) : there exist positive constants c 1 , c 2 , and n 0 such that 0 ≤ c 1 g ( n ) ≤ f ( n ) ≤ c 2 g ( n ) for all n ≥ n 0 } \Theta(g(n))=\{f(n): \text{there exist positive constants } c_1 ,c_2,\text{and } n_0 \text{ such that } 0\le c_1g(n) \le f(n) \le c_2g(n) \text{ for all } n \ge n_0 \} Θ(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}
- 渐进上界
- 渐进下界
算法导论笔记:函数增长
最新推荐文章于 2020-09-26 14:27:16 发布