More about segment tree origin

This commit is contained in:
Antti H S Laaksonen 2017-04-17 20:22:56 +03:00
parent 4ab2897545
commit 636f7c4795
1 changed files with 3 additions and 2 deletions

View File

@ -744,9 +744,10 @@ takes $O(1)$ time using bit operations.
\index{segment tree} \index{segment tree}
A \key{segment tree}\footnote{The origin of this structure is unknown. A \key{segment tree}\footnote{Quite similar structures were used
in the late 1970's to solve geometric problems \cite{ben80}.
The bottom-up-implementation in this chapter corresponds to The bottom-up-implementation in this chapter corresponds to
the implementation in \cite{sta06}.} is a data structure that in \cite{sta06}.} is a data structure
that supports two operations: that supports two operations:
processing a range query and processing a range query and
modifying an element in the array. modifying an element in the array.