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

Better wording? [closes #10]

This commit is contained in:
Antti H S Laaksonen 2017-02-25 12:41:07 +02:00
parent af4499ecbd
commit b0ca108f16
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
chapter02.tex
View File

@ -443,8 +443,8 @@ and the sum of the numbers is calculated to the variable $s$.
The variable $p$ contains the maximum sum found during the search. The variable $p$ contains the maximum sum found during the search.
The time complexity of the algorithm is $O(n^3)$, The time complexity of the algorithm is $O(n^3)$,
because it consists of three nested loops and because it consists of three nested loops
each loop contains $O(n)$ steps. that go through the input.
\subsubsection{Algorithm 2} \subsubsection{Algorithm 2}