From 796d0c9c47f772b8adf605d7ef3398265df0ee74 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Wed, 11 Oct 2017 18:33:07 +0300
Subject: [PATCH] Fix typo

---
 chapter03.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chapter03.tex b/chapter03.tex
index ace3d4f..00b095d 100644
--- a/chapter03.tex
+++ b/chapter03.tex
@@ -218,7 +218,7 @@ For example, the array
 \node at (7.5,0.5) {$8$};
 \end{tikzpicture}
 \end{center}
-has tree inversions: $(6,3)$, $(6,5)$ and $(9,8)$.
+has three inversions: $(6,3)$, $(6,5)$ and $(9,8)$.
 The number of inversions indicates
 how much work is needed to sort the array.
 An array is completely sorted when