diff options
| author | Boris Verkhovskiy <boris.verk@gmail.com> | 2024-04-04 04:26:14 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-04-04 04:26:14 -0700 |
| commit | 4d59048f0df8441e5ad2c2c440e8d54b0e9c11b6 (patch) | |
| tree | fa2dbdd40da35b3c27f928f1112ea43193a7482e /asymptotic-notation.html.markdown | |
| parent | b38d4437120e700646a45dff68b7c4ff3f7109c0 (diff) | |
| parent | 327001f58739489b41f6b1f7bbc8be900847b381 (diff) | |
Merge branch 'master' into patch-2
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 |