Skip to content

Update Complexity_Notation.md #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
zyliutw wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Complexity_Notation.md #10

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions ...ms and Data Structures/Concept series/Complexity/Article/Complexity_Notation.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -227,7 +227,7 @@ $$
**Littel-o($o(·)$)**的定義如下：

$$
o(g(n))=\{\,f(n)：對於所有正整數\:c,存在正整數\:n_0\,,使得對於所有n\geq n_0,\, 0\leq f(n) \leq cg(n)\:\}
o(g(n))=\{\,f(n)：對於所有正整數\:c,存在正整數\:n_0\,,使得對於所有n\geq n_0,\, 0\leq f(n) < cg(n)\:\}
$$

怎麼說**Littel-o($o(·)$)**比較「不緊」呢？因為定義中是「對於所有正整數$c$」，因此$f(n)=o(g(n))$務必要求$g(n)$的「成長率」遠遠大於$f(n)$，等同於滿足以下極限關係式：
Expand Down Expand Up @@ -255,7 +255,7 @@ $$
**Littel-omega($\omega(·)$)**的定義如下：

$$
\omega(g(n))=\{\,f(n)：對於所有正整數\:c,存在正整數\:n_0\,,使得對於所有n\geq n_0,\, 0\leq cg(n) \leq f(n)\:\}
\omega(g(n))=\{\,f(n)：對於所有正整數\:c,存在正整數\:n_0\,,使得對於所有n\geq n_0,\, 0\leq cg(n) < f(n)\:\}
$$

同理，$f(n)=\omega(g(n))$要求$g(n)$的「成長率」遠遠小於$f(n)$，等同於滿足以下極限關係式：
Expand Down