From f15f936c2cb65ef5c05b071860f7a95fda1f0c28 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Fri, 21 Feb 2020 16:12:48 +0100
Subject: [PATCH] Range trees: Fixed complexity of RangeQuery in the summary
---
07-geom/geom.tex | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/07-geom/geom.tex b/07-geom/geom.tex
index ce18c28..4ea36ae 100644
--- a/07-geom/geom.tex
+++ b/07-geom/geom.tex
@@ -325,7 +325,7 @@ for all rebalancing of the constituent 1-d trees. The same argument applies to
Let us summarize time complexity of all operations:
\optable{
\op{Build} &$\O(n\log^{d-1} n)$ \cr
- \op{RangeQuery} &$\O(n\log^d n + p)$ for $p$~reported points \cr
+ \op{RangeQuery} &$\O(\log^d n + p)$ for $p$~reported points \cr
\op{Insert} &$\O(\log^d n)$ amortized \cr
\op{Delete} &$\O(\log^d n)$ amortized \cr
}
--
GitLab