diff options
| author | Pratik Karki <predatoramigo@gmail.com> | 2018-08-15 19:14:43 +0545 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2018-08-15 19:14:43 +0545 |
| commit | 883fe074104c01e46d88d3f90ed6da2ca8651f88 (patch) | |
| tree | d0b2cd1c5e1cd3344e1955217d1be4871a6d430c /asymptotic-notation.html.markdown | |
| parent | 76bb8b21f62a43ffee1828ae23c62021d0d95ec3 (diff) | |
| parent | 9ed484b734807fe0eb9de11b0cd2de054cfc6483 (diff) | |
Merge pull request #3188 from divayprakash/fix-asymptotic-notation
[docs/asymptotic-notation] Fix content error, closes #3006
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 |