Weekly Note 14, DM42, fall 2006
Discussion Section December 11
Cancelled.
Lecture December 13
-
Sub-Logaritmic Searching and Sorting [A95].
-
About the exam.
-
Course evaluation.
Announcements
- The topic of meldable heap-ordered trees from the discussion
section on December 4 was based on:
- Maxiphobic Heaps
- Chris Okasaki.
Fun with Binary Heap Trees.
Chapter 1 of
The Fun of Programming, J. Gibbons, O. de Moor (eds.),
Palgrave Macmillan, 2003, 1-16.
ISBN 0333992857.
-
Remember to apply for teaching asistantships (instruktorater).
Announcements will be out shortly.
Last modified: Tue Dec 5 14:19:06 CET 2006
Kim Skak Larsen
(kslarsen@imada.sdu.dk)