算法分析基础---渐进复杂度

最新推荐文章于 2024-08-04 21:58:45 发布

zjontheway

最新推荐文章于 2024-08-04 21:58:45 发布

阅读量680

点赞数

文章标签：算法

Notation	Name^[13]	Description	Formal Definition	Limit Definition^[16]^[17]^[18]^[13]^[11]
$f(n)=o(g(n))$	Small O; Small Oh	$f$ is dominated by $g$ asymptotically	$\forall k>0\;\exists n_{0}\;\forall n>n_{0}\;\|f(n)\|\leq k\cdot \|g(n)\|$	$\lim _{n\to \infty }{\frac {f(n)}{g(n)}}=0$
$f(n)=O(g(n))$	Big O; Big Oh; Big Omicron	$\|f\|$ is bounded above by $g$ (up to constant factor) asymptotically	$\exists k>0\;\exists n_{0}\;\forall n>n_{0}\;\|f(n)\|\leq k\cdot g(n)$	$\limsup _{n\to \infty }{\frac {\left\|f(n)\right\|}{g(n)}}<\infty$
$f(n)=\Theta (g(n))$	Big Theta	$f$ is bounded both above and below by $g$ asymptotically	$\exists k_{1}>0\;\exists k_{2}>0\;\exists n_{0}\;\forall n>n_{0}$ $k_{1}\cdot g(n)\leq f(n)\leq k_{2}\cdot g(n)$	$f(n)=O(g(n))$ and $f(n)=\Omega (g(n))$ (Knuth version)
$f(n)\sim g(n)$	On the order of	$f$ is equal to $g$ asymptotically	$\forall \varepsilon >0\;\exists n_{0}\;\forall n>n_{0}\;\left\|{f(n) \over g(n)}-1\right\|<\varepsilon$	$\lim _{n\to \infty }{f(n) \over g(n)}=1$
$f(n)=\Omega (g(n))$	Big Omega in number theory (Hardy-Littlewood)	$\|f\|$ is not dominated by $g$ asymptotically	$\exists k>0\;\forall n_{0}\;\exists n>n_{0}\;\|f(n)\|\geq k\cdot g(n)$	$\limsup _{n\to \infty }\left\|{\frac {f(n)}{g(n)}}\right\|>0$
$f(n)=\Omega (g(n))$	Big Omega in complexity theory (Knuth)	$f$ is bounded below by $g$ asymptotically	$\exists k>0\;\exists n_{0}\;\forall n>n_{0}\;f(n)\geq k\cdot g(n)$	$\liminf _{n\to \infty }{\frac {f(n)}{g(n)}}>0$
$f(n)=\omega (g(n))$	Small Omega	$f$ dominates $g$ asymptotically	$\forall k>0\;\exists n_{0}\;\forall n>n_{0}\ \|f(n)\|\geq k\cdot \|g(n)\|$	$\lim _{n\to \infty }\left\|{\frac {f(n)}{g(n)}}\right\|=\infty$

1、简单来说，big-O表示的是上界，big-Theta表示的是渐进紧确界，big-Omega表示的是下界。

2、(1)Θ（西塔）：紧确界。相当于"="

(2)O （大欧）：上界。相当于"<="

(3)o（小欧）：非紧的上界。相当于"<"

(4)Ω（大欧米伽）：下界。相当于">="

(5)ω（小欧米伽）：非紧的下界。相当于">"

3、 $o(f)\subset O(f)$ (and thus the above properties apply with most combinations of o and O).

4、

T(n) = O(n¹⁰⁰)
T(n) = O(n³)
T(n) = Θ(n³)

The equivalent English statements are respectively:

T(n) grows asymptotically no faster than n¹⁰⁰
T(n) grows asymptotically no faster than n³
T(n) grows asymptotically as fast as n³.

zjontheway

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
算法分析基础---渐进复杂度

NotationName[13]DescriptionFormal DefinitionLimit Definition[16][17][18][13][11]Small O; Small Oh is dominated by asymptotically0\;\exists n_{0}\;\forall n>n_{0}
复制链接

扫一扫