summaryrefslogtreecommitdiff
path: root/datastructures/datastructures.tex
diff options
context:
space:
mode:
authorMZuenni <michi.zuendorf@gmail.com>2023-02-10 11:56:51 +0100
committerMZuenni <michi.zuendorf@gmail.com>2023-02-10 11:56:51 +0100
commit8b70f09245442827bb906a9a56d19172e2a62752 (patch)
treeac43932d468a676aaec2d5319a4bbe00e1a85ec0 /datastructures/datastructures.tex
parent3c5ae1141482f3791c6a36408a70da951c5565c7 (diff)
added methods (nicer column break)
Diffstat (limited to 'datastructures/datastructures.tex')
-rw-r--r--datastructures/datastructures.tex6
1 files changed, 5 insertions, 1 deletions
diff --git a/datastructures/datastructures.tex b/datastructures/datastructures.tex
index c39a2c6..88bbd8c 100644
--- a/datastructures/datastructures.tex
+++ b/datastructures/datastructures.tex
@@ -45,7 +45,7 @@
\begin{algorithm}{Wavelet Tree}
\begin{methods}
\method{Constructor}{baut den Baum auf}{n\*\log(n)}
- \method{kth}{sort$[l, r)[k]$}{\log(n)}
+ \method{kth}{sort $[l, r)[k]$}{\log(n)}
\method{countSmaller}{Anzahl elemente in $[l, r)$ kleiner als $k$}{\log(n)}
\end{methods}
\sourcecode{datastructures/waveletTree.cpp}
@@ -59,6 +59,10 @@
\end{algorithm}
\begin{algorithm}{(Implicit) Treap (Cartesian Tree)}
+ \begin{methods}
+ \method{insert}{fügt wert $\mathit{val}$ an stelle $i$ ein (verschiebt alle Positionen >= $i$)}{\log(n)}
+ \method{remove}{löscht werte $[i,i+\mathit{count})$}{\log(n)}
+ \end{methods}
\sourcecode{datastructures/treap2.cpp}
\end{algorithm}