![[topimage]](IMADA_en.png)
Lecture
-
Foundations, (Amortized) Complexity, and Scanning versus Random Access
- Is Ω(n log n) a reasonable lower bound for our geometric problems, considering the modeling issues?
- How do we make all the static structures dynamic and what is the cost?
- What's the difference between sorting once and repeatedly finding the median?
- Event structure: search tree, heap, or sorted list?
- Why are we not worried about appending to lists?
- Why do we like red-black trees as our base data structure for many problems - are there better search trees for this?