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

Mo's algorithm origin

This commit is contained in:
Antti H S Laaksonen 2017-02-22 21:53:11 +02:00
parent b12d09ee6c
commit 5f19acc6c4
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
chapter27.tex
View File

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