diff options
| author | Boris Verkhovskiy <boris.verk@gmail.com> | 2024-04-03 02:02:49 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-04-03 02:02:49 -0700 |
| commit | 616e40816dfdf90c2418477327729169db0274b3 (patch) | |
| tree | 0b5ae76e529c34f6648442815f535626eaeebf69 /asymptotic-notation.html.markdown | |
| parent | 3e22775a641831a82c59a3b6197240b2fcd9a76b (diff) | |
| parent | 638494ae2a0c089717f2bfff965da52e3b15a4f9 (diff) | |
Merge branch 'master' into elixir-casing
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 |