Tai -> or

This commit is contained in:
Antti H S Laaksonen 2017-01-07 15:42:53 +02:00
parent 190b4ad1bb
commit a999258ce3
1 changed files with 2 additions and 2 deletions

View File

@ -308,9 +308,9 @@ assuming that the time limit is one second.
\begin{tabular}{ll}
input size ($n$) & desired time complexity \\
\hline
$n \le 10^{18}$ & $O(1)$ tai $O(\log n)$ \\
$n \le 10^{18}$ & $O(1)$ or $O(\log n)$ \\
$n \le 10^{12}$ & $O(\sqrt n)$ \\
$n \le 10^6$ & $O(n)$ tai $O(n \log 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)$ \\