production #22
@ -317,8 +317,7 @@ Weiterführendes Beispiel
|
||||
\begin{table}[h]
|
||||
\begin{tabular}{llr}
|
||||
\toprule
|
||||
Struktur & \multicolumn{2}{l}{Zeitkomplexität für Zugriff} \\ \cmidrule(r){2-3}
|
||||
& Average & Worst \\
|
||||
Struktur & \multicolumn{2}{l}{Zeitkomplexität für Zugriff} \\ \cmidrule(r){2-3} & Average & Worst \\
|
||||
\midrule
|
||||
Stack & $\mathcal{O}(n)$ & $\mathcal{O}(n)$ \\
|
||||
Binärbaum & $\mathcal{O}(log(n))$ & $\mathcal{O}(log(n))$ \\
|
||||
|
||||
@ -317,8 +317,7 @@ An advanced example
|
||||
\begin{table}[h]
|
||||
\begin{tabular}{llr}
|
||||
\toprule
|
||||
Structure & \multicolumn{2}{l}{Access time complexity} \\ \cmidrule(r){2-3}
|
||||
& Average & Worst \\
|
||||
Structure & \multicolumn{2}{l}{Access time complexity} \\ \cmidrule(r){2-3} & Average & Worst \\
|
||||
\midrule
|
||||
Stack & $\mathcal{O}(n)$ & $\mathcal{O}(n)$ \\
|
||||
Binary tree & $\mathcal{O}(log(n))$ & $\mathcal{O}(n)$ \\
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user