Add selection of time complexities

lectures/complexity/slides.qmd

@@ -15,7 +15,7 @@ Amount of resources needed for algorithms working on data structures
 
  - Time to run an algorithm with given data size
  - Often main focus of complexity analysis
- 
+
 **Space Complexity**
 
  - Memory required to run an algorithm with given data size
@@ -34,6 +34,22 @@ Amount of resources needed for algorithms working on data structures
 | quadratic    | $\mathcal{O}(n^2)$     |
 
 
+## Selection of Time Complexities
+
+:::{.smaller}
+
+Data structure    Access                    Insert/Delete                           Search
+---------------   -----------------------   -------------------------------------   -------------------------------------
+Array             $\mathcal{O}(1)$          $\mathcal{O}(n)$                        $\mathcal{O}(n)$
+Linked list       $\mathcal{O}(n)$          $\mathcal{O}(1)$                        $\mathcal{O}(n)$
+Hash table        ---                       $\mathcal{O}(1)$ -- $\mathcal{O}(n)$    $\mathcal{O}(1)$ -- $\mathcal{O}(n)$
+Tree[^1]          $\mathcal{O}(\log{n})$    $\mathcal{O}(\log{n})$                  $\mathcal{O}(\log{n})$
+
+[^1]: Some types of trees have $\mathcal{O}(\log{n})$ -- $\mathcal{O}(n)$ for insert/delete and search
+
+:::
+
+
 # specific algorithms
 
 * sorting (e.g. bubble, quick, merge, bogo... [idea instructions](https://idea-instructions.com))
@@ -41,11 +57,6 @@ Amount of resources needed for algorithms working on data structures
 * bisect (?) (ref to `git bisect`)
 
 
-## Revisiting arrays and linked-lists
-
- - Access time
- - Searching
-
 
 # models of computation