From 93bb7d1ed928a8e206b914e2f4d0b15b84bb4d82 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Fri, 24 Feb 2017 00:38:24 +0200
Subject: [PATCH] Better table of estimates

---
 chapter02.tex | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/chapter02.tex b/chapter02.tex
index 15141ee..b686b13 100644
--- a/chapter02.tex
+++ b/chapter02.tex
@@ -309,15 +309,15 @@ assuming that the time limit is one second.
 
 \begin{center}
 \begin{tabular}{ll}
-input size ($n$) & required time complexity \\
+input size & required time complexity \\
 \hline
-$n \le 10^{18}$ & $O(1)$ or $O(\log n)$ \\
-$n \le 10^{12}$ & $O(\sqrt n)$ \\
-$n \le 10^6$ & $O(n)$ or $O(n \log n)$ \\
-$n \le 5000$ & $O(n^2)$ \\
-$n \le 500$ & $O(n^3)$ \\
-$n \le 25$ & $O(2^n)$ \\
-$n \le 10$ & $O(n!)$ \\
+$n \approx 10$ & $O(n!)$ \\
+$n \approx 20$ & $O(2^n)$ \\
+$n \approx 100$ & $O(n^3)$ \\
+$n \approx 1000$ & $O(n^2)$ \\
+$n \approx 10^5$ & $O(n \log n)$ \\
+$n \approx 10^6$ & $O(n)$ \\
+$n$ is large & $O(1)$ or $O(\log n)$ \\
 \end{tabular}
 \end{center}