#57 3.2-2

wojtask · Jun 29, 2023 · e6b3965 · e6b3965
1 parent e70bd1a
commit e6b3965
Showing 1 changed file with 4 additions and 0 deletions.
diff --git a/chapter03/sections/2/2.tex b/chapter03/sections/2/2.tex
@@ -0,0 +1,4 @@
+Let $T(n)$ be the running time of algorithm $A$.
+The statement ``$T(n)$ is at least $O(n^2)$'' means that $T(n)\ge f(n)$, where $f(n)=O(n^2)$.
+In particular, we can choose $f(n)=0$, and the statement will remain true for any $T(n)$.
+Thus, the statement does not characterize $T(n)$ in any meaningful way.