course material for comparing algorithms class
an introduction is how to figure out the complexity of a couple of search algorithms and some well-known recursive monsters.
differences between linked lists, binary trees, heaps and arrays.
because it wouldn't be a course on algorithms without showing off some famous sorting algorithms.
randomised algorithms and data structures, dynamic programming.
when should you use a skip list over a balanced binary tree? How does randomisation help optimisation? WTF is dynamic programming and how can it help you?