算法渐近符号

渐近记号-算法

Big-Oh(渐近上界)

$\bullet$ $O$-notation: For a given function g$(n)$, we denote $O(\mathfrak{g}(n))$ the set of functions $O($g ( n ) ) = { f ( n ) : (n))=\{f(n): (n))={f(n):there exist positive constants $c$ and $n_0$ such that $0\le f(n)\le cg(n)$ for all $n\ge n_0\}$

Big-Omega(渐近下界)

$\bullet$ $\Omega$-notation: For a given function $g(n)$, we denote $\Omega (\mathfrak{g}(n))$ the set of functions $\Omega ($g ( n ) ) = { f ( n ) : (n))=\{f(n): (n))={f(n):there exist positive constants $c$ and $n_0$ such that $0\le c$g$(n)\le f(n)$ for all $n\ge n_0\}$

Big-Theta(渐近紧界)

$\bullet$ $\Theta$-notation: For a given function $g(n)$,we denote $\Theta (\mathfrak{g}(n))$ the set of functions $\Theta ($g ( n ) ) = { f ( n ) : (n))=\{f(n): (n))={f(n):there exist positive constants $c_1,c_2$ and $n_0$ such that $0\le c_1$g$(n)\le f(n)\le c_2$g$(n)$ for all $n\ge n_0\}$

$\bullet$ Theorem: For any two functions $f(n)$ and g$(n)$, we have $f(n)=\Theta ($g$(n))$ if and only if $f(n)=O\left(\mathrm{g}(n)\right)$ and $f(n)=$$\Omega \left(\mathrm{g}(n)\right).$

Example

$\begin{array}{rl}& \text{Example: How to show that }{n}^2/2-3n=\Theta (n^2)?\\ & \text{We must determine positive constants }{c}_1,c_2\mathrm{and}{n}_0\text{ such that}\\ & c_1{n}^2\le n^2/2-3n\le c_2{n}^2\\ & \Rightarrow c_1\le 1/2-3/n\le c_2\\ & \text{By choosing }{c}_1=1/14,c_2=1/2,\mathrm{and}{n}_0=7,\text{we can verify}\\ & \text{that }{n}^2/2-3n=9(n^2)\\ & \text{The key is some choice exists.}\end{array}$

Small-Oh(非渐近紧上界)

Small-Omega(非渐近紧下界)

简记

An interesting fact about logarithm

$$lo{g}_{b_1}n=O(lo{g}_{b_2}n)$$
For any constant b${}_1>1$ and ${\mathfrak{b}}_2>1.$

Because of the above, in computer science, we omit all the constant logarithm bases in big-O. For example, instead of $\mathcal{O}({\log }_2$ n), we will simply write $\mathcal{O}(\log$ n)
$\bullet$ Essentially, this says that"you are welcome to put any constant base there, and it will be the same

$\text{asymptotically" . }$

$\cdot$ Obviously, $\Omega ,\Theta$ also have this property.