diff options
| author | Boris Verkhovskiy <boris.verk@gmail.com> | 2024-04-03 04:31:13 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-04-03 04:31:13 -0700 |
| commit | fbf132752b743d0f43c3395da0699bee53da22df (patch) | |
| tree | 56da43c86e1aebd24e3913b405e21d6f2812e9a3 /asymptotic-notation.html.markdown | |
| parent | 247dc6e86c1421fa031e4b61c42c05ca6e09bfb0 (diff) | |
| parent | c166f2acb295627c5ae305a6dd517a27ca8fece6 (diff) | |
Merge branch 'master' into patch-1
Diffstat (limited to 'asymptotic-notation.html.markdown')
| -rw-r--r-- | asymptotic-notation.html.markdown | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/asymptotic-notation.html.markdown b/asymptotic-notation.html.markdown index a6acf54e..0739c02d 100644 --- a/asymptotic-notation.html.markdown +++ b/asymptotic-notation.html.markdown @@ -135,7 +135,7 @@ Let's look at the definition of Big-O. 3 * n^2 <= c * n ``` -Is there some pair of constants c, n<sub>0</sub> that satisfies this for all n > <sub>0</sub>? +Is there some pair of constants c, n<sub>0</sub> that satisfies this for all n > n<sub>0</sub>? No, there isn't. `f(n)` is NOT O(g(n)). ### Big-Omega |