missing period

lectures/complexity/index.html

@@ -190,7 +190,7 @@ <h2>Reasoning with asymptotic complexity</h2>
 O(n+1) = O(n) \), these are (true) statements about the equality of sets of
 functions.  Sometimes people write “equations” like \( 5n+1 = O(n) \) that are
 not really equations. What is meant is that the function \( f(n) = 5n + 1 \) is
-in the set \( O(n) \), or that \(O(5n+1) = O(n)\) It is also a common shorthand
+in the set \( O(n) \), or that \(O(5n+1) = O(n)\). It is also a common shorthand
 to use mathematical operations on big-O expressions as if they were numbers.
 For example, we might write \( O(n) + O(n^2) = O(n^2) \) to mean the true
 statement that the sum of any two functions that are respectively