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

Add reference to Mo's algorithm

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-04-22 12:00:43 +03:00
parent e8608fa76f
commit 334cf16de7
2 changed files with 12 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

3
chapter27.tex
View file

@ -315,7 +315,8 @@ 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, but
the technique has appeared earlier in the literature.} 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.
Since the array is static, the queries can be