The first lecture descibed the shell sort. You professor may choose to skip this lesson if the class needs extra time on other methods.

The second lecture describes the quick sort. Sorting is a useful tool in learning to program because it is easy to see when it is working, but, expecially for the more efficient sorting methods, it is complicated to implement.

The third lecture covers merge sort, another eficient sorting method.

The tutorial contains questions from which the quiz, the sessionals and the final will be selected. It contains question on the advanced sorting techniques: shell, quick and merge sorts.

In this lab you will demonstrate matrix the bubble, insertion and selection sorts.

Remember to download the files for next week using "wget ds.nathanielgmartin/wk4-arrays.zip".

This is the backlog you will be working from this week.