nitpick - It feels weird reading "sort" followed by "O(n)"

lrvideckis · adamant-pwn · commit 0d54cff1f4db · 2022-12-13T03:08:28.000+01:00
diff --git a/src/string/suffix-array.md b/src/string/suffix-array.md
@@ -201,7 +201,7 @@ We use temporary arrays $pn[]$ and $cn[]$ to store the permutation by the second
 }
 ```
 The algorithm requires $O(n \log n)$ time and $O(n)$ memory.
-However if we take the size of the alphabet $k$ into account, then it uses $O(n \log n + k)$ time and $O(n + k)$ memory. The first sort takes $O(k)$ time, but all following sorts are bounded by the number of equivalence classes, and take $O(n)$ time.
+However if we take the size of the alphabet $k$ into account, then it uses $O(n \log n + k)$ time and $O(n + k)$ memory. The first counting sort takes $O(k)$ time, but all following counting sorts are bounded by the number of equivalence classes, and take $O(n)$ time.
 
 For simplicity we used the complete ASCII range as alphabet.
 If we know that the string only contains a subset of characters, e.g. only lowercase letters, then this implementation can obviously be optimized.

Original file line number	Diff line number	Diff line change
`@@ -201,7 +201,7 @@ We use temporary arrays $pn[]$ and $cn[]$ to store the permutation by the second`
`201`	`201`	`}`
`202`	`202`	```
`203`	`203`	`The algorithm requires $O(n \log n)$ time and $O(n)$ memory.`
`204`		`-However if we take the size of the alphabet $k$ into account, then it uses $O(n \log n + k)$ time and $O(n + k)$ memory. The first sort takes $O(k)$ time, but all following sorts are bounded by the number of equivalence classes, and take $O(n)$ time.`
	`204`	`+However if we take the size of the alphabet $k$ into account, then it uses $O(n \log n + k)$ time and $O(n + k)$ memory. The first counting sort takes $O(k)$ time, but all following counting sorts are bounded by the number of equivalence classes, and take $O(n)$ time.`
`205`	`205`
`206`	`206`	`For simplicity we used the complete ASCII range as alphabet.`
`207`	`207`	`If we know that the string only contains a subset of characters, e.g. only lowercase letters, then this implementation can obviously be optimized.`