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

Fix typo

This commit is contained in:
Antti H S Laaksonen 2017-10-11 18:33:07 +03:00
parent 4c008c7fe4
commit 796d0c9c47
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

@ -218,7 +218,7 @@ For example, the array
\node at (7.5,0.5) {$8$}; \node at (7.5,0.5) {$8$};
\end{tikzpicture} \end{tikzpicture}
\end{center} \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 The number of inversions indicates
how much work is needed to sort the array. how much work is needed to sort the array.
An array is completely sorted when An array is completely sorted when