diff options
| author | Divay Prakash <divayprakash@users.noreply.github.com> | 2018-10-24 11:30:23 +0530 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-10-24 11:30:23 +0530 |
| commit | adfd3064e52e769dc46f62d8302be7e28be4e48d (patch) | |
| tree | 204d82adc9f82ae4fe377b631a1406b97eb6b11d /asymptotic-notation.html.markdown | |
| parent | 92022da0a6ea9417521563de9e537f337c426465 (diff) | |
| parent | 8f5a67190705c9a3101653901d8f8a7b48eb1775 (diff) | |
Merge branch 'master' into MarkdownFRChanges
Diffstat (limited to 'asymptotic-notation.html.markdown')
| -rw-r--r-- | asymptotic-notation.html.markdown | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/asymptotic-notation.html.markdown b/asymptotic-notation.html.markdown index 6a6df968..a1dfe9e1 100644 --- a/asymptotic-notation.html.markdown +++ b/asymptotic-notation.html.markdown @@ -155,7 +155,7 @@ Small-o, commonly written as **o**, is an Asymptotic Notation to denote the upper bound (that is not asymptotically tight) on the growth rate of runtime of an algorithm. -`f(n)` is o(g(n)), if for some real constants c (c > 0) and n<sub>0</sub> (n<sub>0</sub> > 0), `f(n)` is < `c g(n)` +`f(n)` is o(g(n)), if for all real constants c (c > 0) and n<sub>0</sub> (n<sub>0</sub> > 0), `f(n)` is < `c g(n)` for every input size n (n > n<sub>0</sub>). The definitions of O-notation and o-notation are similar. The main difference @@ -168,7 +168,7 @@ Small-omega, commonly written as **ω**, is an Asymptotic Notation to denote the lower bound (that is not asymptotically tight) on the growth rate of runtime of an algorithm. -`f(n)` is ω(g(n)), if for some real constants c (c > 0) and n<sub>0</sub> (n<sub>0</sub> > 0), `f(n)` is > `c g(n)` +`f(n)` is ω(g(n)), if for all real constants c (c > 0) and n<sub>0</sub> (n<sub>0</sub> > 0), `f(n)` is > `c g(n)` for every input size n (n > n<sub>0</sub>). The definitions of Ω-notation and ω-notation are similar. The main difference |