![[topimage]](IMADA_en.png)
Lecture
-
Foundations:
- Is Ω(n log n) a reasonable lower bound for our geometric problems, considering the modeling issues?
- What's the difference between sorting once and repeatedly finding the median?
- How do we make all the static structures dynamic?
- Amortized Complexity:
- Are the complexity arguments for convex hull etc. solid?
- Why have we not worried about appending to lists?
- Why do we like red-black trees as our base data structure for many problems?