diff options
| author | Mathieu Gemard <mathieu.gemard@gmail.com> | 2024-01-01 13:47:02 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-01 13:47:02 +0100 |
| commit | c0fa7cf2c68033cce71b30116be6985f1506b6e4 (patch) | |
| tree | 08be398eaeb6dd7f06ded30298f81c18acaecfd2 /asymptotic-notation.html.markdown | |
| parent | ca852c8b7d8f1a84da380f3ce86fcb0b6a1a5a02 (diff) | |
[asymptotic-notation/en] Typo, add a missing n (#4820)
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 |