Mo's algorithm origin
This commit is contained in:
parent
b12d09ee6c
commit
5f19acc6c4
|
@ -314,9 +314,9 @@ 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
|
||||
\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
|
||||
that require processing range queries in
|
||||
a \emph{static} array.
|
||||
Before processing the queries, the algorithm
|
||||
|
|
Loading…
Reference in New Issue