bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Better table of estimates

This commit is contained in:
Antti H S Laaksonen 2017-02-24 00:38:24 +02:00
parent 8868ff10ab
commit 93bb7d1ed9
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
chapter02.tex
View File

@ -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}