The first lecture reviews pointers.

The second lecture introduces singly linked lists.

The third lecture completes the coverage of simply linked lists. The slides are the same as a previous lesson.

The tutorial contains questions on linked lists.

In this week you will begin working on the faster, more complicated sorts: merge and quick. The files are on the web at ds.nathanielgmartin.com/wk5-arrays.zip.

You will demonstrate insertion sort, linear search, and binary search.

This is the backlog you will be working from this week. It uses material covered in prevous classes. You will be demoing material from the Arrays Backlog this week and next.

This is the backlog for the material covered in lecture this week. You will not be demoning the material in this backlog until Week 7, but it is a good idea to look over the backlog and to download the project files using wget ds.nathanielgmartin.com/LinkedList.zip.