From 6d97177d7d65582d093d50a7c9bd14e524677f0c Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Wed, 8 Mar 2017 19:28:39 +0200 Subject: [PATCH] Fix the -> an --- chapter03.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chapter03.tex b/chapter03.tex index b5a5f43..a154367 100644 --- a/chapter03.tex +++ b/chapter03.tex @@ -15,7 +15,7 @@ If the array contains two equal elements, they will be next to each other after sorting, so it is easy to find them. Also, the problem ''what is the most frequent element -in the array?'' can be solved similarly. +in an array?'' can be solved similarly. There are many algorithms for sorting, and they are also good examples of how to apply