OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
74b18c7
)
Fix style issue
author
Guanghao Ye
<yeguanghao1999@gmail.com>
Thu, 23 Aug 2018 03:41:28 +0000
(20:41 -0700)
committer
GitHub
<noreply@github.com>
Thu, 23 Aug 2018 03:41:28 +0000
(20:41 -0700)
docs/misc/complexity.md
patch
|
blob
|
history
diff --git
a/docs/misc/complexity.md
b/docs/misc/complexity.md
index
32dde9e
..
038a688
100644
(file)
--- a/
docs/misc/complexity.md
+++ b/
docs/misc/complexity.md
@@
-20,6
+20,7
@@
$$O(g(n)) = \{f(n):存在常数 c,n_0 使得 0\leq f(n) \leq cg(n), \qquad \fora
### $\Omega$ 符号
同样的,我们使用$\Omega$符号来描述一个函数的渐进下界。
+
$$\Omega(g(n)) = \{f(n):存在常数 c,n_0 使得 0 \leq cg(n) \leq f(n) , \qquad \forall n \geq n_0\}$$
![](images/order.png)
@@
-34,4
+35,4
@@
$$T(n) = AT\left(\frac{n}{b}\right)+cn^k, \qquad \forall n > b$$
$$
T(n) = \begin{cases}\Theta(n^{\log_b a}) & a > b^k \\ \Theta(n^k) & a< b^k \\ \Theta(n^k\log n ) & a = b^k \end{cases}
-$$
\ No newline at end of file
+$$