Small fix

This commit is contained in:
Antti H S Laaksonen 2017-02-21 01:18:17 +02:00
parent 07816edf67
commit 475c16c7e2
1 changed files with 1 additions and 1 deletions

View File

@ -316,7 +316,7 @@ because both cases take a total of $O(n \sqrt n)$ time.
\key{Mo's algorithm} \footnote{According to \cite{cod15}, this algorithm
is named after Mo Tao, a Chinese competitive programmer. However,
the technique has been appeared earlier in the literature \cite{ken06}.} can be used in many problems
the technique has appeared earlier in the literature \cite{ken06}.} can be used in many problems
that require processing range queries in
a \emph{static} array.
Before processing the queries, the algorithm