From c0fa7cf2c68033cce71b30116be6985f1506b6e4 Mon Sep 17 00:00:00 2001
From: Mathieu Gemard <mathieu.gemard@gmail.com>
Date: Mon, 1 Jan 2024 13:47:02 +0100
Subject: [asymptotic-notation/en] Typo, add a missing n (#4820)

---
 asymptotic-notation.html.markdown | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'asymptotic-notation.html.markdown')

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
-- 
cgit v1.2.3