From b0ca108f16f5d455211d39631deb1b82357ba558 Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Sat, 25 Feb 2017 12:41:07 +0200 Subject: [PATCH] Better wording? [closes #10] --- chapter02.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/chapter02.tex b/chapter02.tex index b2212ac..f8ababa 100644 --- a/chapter02.tex +++ b/chapter02.tex @@ -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 time complexity of the algorithm is $O(n^3)$, -because it consists of three nested loops and -each loop contains $O(n)$ steps. +because it consists of three nested loops +that go through the input. \subsubsection{Algorithm 2}