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

View File

@ -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