Compare commits
3 Commits
b4ab0f38d4
...
b1e72b479b
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
b1e72b479b | ||
|
|
e31d98165d | ||
|
|
d01e0e7a2b |
@ -13,10 +13,6 @@ Referenzen und Fußnoten
|
||||
Fußnoten <span class="emoji">📎</span>
|
||||
|
||||
@content
|
||||
``` {.hljs .lang-tex}
|
||||
\usepackage{hyperref}
|
||||
```
|
||||
|
||||
Die Nummerierung erfolgt automatisch und ist fortlaufend, unabhängig davon, ob ein neuer Abschnitt beginnt.
|
||||
|
||||
``` {.hljs .lang-tex}
|
||||
|
||||
@ -13,14 +13,8 @@ References and footnotes
|
||||
Footnotes <span class="emoji">📎</span>
|
||||
|
||||
@content
|
||||
``` {.hljs .lang-tex}
|
||||
\usepackage{hyperref}
|
||||
```
|
||||
|
||||
Footnotes are automatically numbered consecutively, independent of sections.
|
||||
|
||||
(Here, `hyperref` is used for the `\url` command, it is not necessary for footnotes per se.)
|
||||
|
||||
``` {.hljs .lang-tex}
|
||||
The wild boar (\textit{Sus scrofa}), also
|
||||
known as the wild swine, common wild pig,
|
||||
@ -44,7 +38,7 @@ Cross-references
|
||||
Manually (just don’t!)
|
||||
|
||||
``` {.hljs .lang-tex}
|
||||
As you can see in figure 23, …
|
||||
As you can see in Figure 23, …
|
||||
```
|
||||
|
||||
Using the `\ref` command:
|
||||
|
||||
@ -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