Scale down table on Big-O-Notation slide

lectures/complexity/slides.qmd

@@ -26,6 +26,8 @@ Amount of resources needed for algorithms working on data structures
  - With enough data, usually only the order in relation to input data $n$ is important
  - Therefore the big-$\mathcal{O}$ notation describes the asymptotic behaviour of running an algorithm
 
+:::{.smaller}
+
 | Order        | Notation               |
 | ------------ | ---------------------- |
 | constant     | $\mathcal{O}(1)$       |
@@ -33,6 +35,8 @@ Amount of resources needed for algorithms working on data structures
 | linear       | $\mathcal{O}(n)$       |
 | quadratic    | $\mathcal{O}(n^2)$     |
 
+:::
+
 
 ## Selection of Time Complexities