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

Small fix

This commit is contained in:
Antti H S Laaksonen 2017-05-17 23:06:21 +03:00
parent 2697233dcb
commit 4dfe818c53
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chapter02.tex
View File

@ -527,8 +527,8 @@ The comparison shows that all algorithms
are efficient when the input size is small, are efficient when the input size is small,
but larger inputs bring out remarkable but larger inputs bring out remarkable
differences in the running times of the algorithms. differences in the running times of the algorithms.
The $O(n^3)$ time algorithm 1 becomes slow Algorithm 1 becomes slow
when $n=10^4$, and the $O(n^2)$ time algorithm 2 when $n=10^4$, and Algorithm 2
becomes slow when $n=10^5$. becomes slow when $n=10^5$.
Only the $O(n)$ time algorithm 3 is able to process Only Algorithm 3 is able to process
even the largest inputs instantly. even the largest inputs instantly.