Work Note 14, DM819, fall 2015
Lecture December 1
-
Foundations:
-
Why do we like red-black trees as our base data structure for many
problems?
-
Despite of this, should we sometimes consider other data structures?
-
Is Ω(n log n) a reasonable lower bound for our geometric
problems, considering the modelling issues?
-
What's the difference between sorting once and repeatedly finding the median?
-
Is linear time heap building significantly better than just inserting all keys into a search tree?
Exercises December 3
-
Exercises 15.1, 15.3, 15.5.
-
The remaining three problems from Work Note 12 on
matrysohkas, polygon paths, and dominating points.
-
About the exam.
Last modified: Fri Nov 27 08:54:24 CET 2015
Kim Skak Larsen
(kslarsen@imada.sdu.dk)