From 4dfe818c53e530610cb161c8ba9de17f8cc37548 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Wed, 17 May 2017 23:06:21 +0300
Subject: [PATCH] Small fix

---
 chapter02.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/chapter02.tex b/chapter02.tex
index 16400db..b1a7678 100644
--- a/chapter02.tex
+++ b/chapter02.tex
@@ -527,8 +527,8 @@ The comparison shows that all algorithms
 are efficient when the input size is small,
 but larger inputs bring out remarkable
 differences in the running times of the algorithms.
-The $O(n^3)$ time algorithm 1 becomes slow
-when $n=10^4$, and the $O(n^2)$ time algorithm 2
+Algorithm 1 becomes slow
+when $n=10^4$, and Algorithm 2
 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.