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

Fix the -> an

This commit is contained in:
Antti H S Laaksonen 2017-03-08 19:28:39 +02:00
parent 8ac4fac9ff
commit 6d97177d7d
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter03.tex
View File

@ -15,7 +15,7 @@ If the array contains two equal elements,
they will be next to each other after sorting, they will be next to each other after sorting,
so it is easy to find them. so it is easy to find them.
Also, the problem ''what is the most frequent element 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 There are many algorithms for sorting, and they are
also good examples of how to apply also good examples of how to apply