From 5f19acc6c4e2fd1c89dbde1088db9776fb33b04f Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Wed, 22 Feb 2017 21:53:11 +0200 Subject: [PATCH] Mo's algorithm origin --- chapter27.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/chapter27.tex b/chapter27.tex index 38bbbad..8117e9d 100644 --- a/chapter27.tex +++ b/chapter27.tex @@ -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