Here are all the various lecture slides for my ancient 1998 course on (basic) algorithms, put here at the request of Paul Taylor. They were prepared in Word 5.1a of blessed memory, which no longer runs on the Mac I've got (the one that ran it was stolen, sob!), so they won't ever be updated so far as I can see.

<p>
<a href="notes for slides 1.pdf">background</a> a starting handout.
</p>

<p>
<a href="slides 1 shift.pdf">basics</a> with an array-shift algorithm.
</p>

<p>
<a href="slides 2 sorts.pdf">sorts</a> big-O notation introduced, selection sort, bubble sort, insertion sort.
</p>

<p>
<a href="slides 3 shellsort.pdf">shellsort</a> (if you read this you will see that I never really understood it).
</p>

<p>
<a href="slides 4 maths.pdf">big-O</a> lots of detail and explanation.
</p>

<p>
<a href="slides 5 mergesort.pdf">mergesort</a> long worked example.
</p>

<p>
<a href="slides 6 quicksort.pdf">quicksort</a> long worked example, with a nice version of the algorithm (P5, p42).
</p>

<p>
<a href="slides 7 binchop.pdf">binary chop</a> with all the pitfalls mapped.
</p>

<p>
<a href="slides 8 hashing.pdf">hashing</a> including why linear rehash is good enough (which now Wikipedia says is wrong, so I must be wrong there).
</p>

<p>
<a href="slides 9 circshift.pdf">circular shift</a> an old favourite of mine.
</p>

<p>
<a href="slides 10 recdicts.pdf">trees</a> with AVL trees and B-trees, using dictionaries as the application.
</p>

<p>
<a href="notes on B-trees.pdf">implementation of B-trees</a> because they are lovely, and my friend Keith Clarke loves them.
</p>

<p>
<a href="slides 11 graphs.pdf">graphs</a> marking, searching, inc. Dijkstra's algorithm and A-star. The remark about the London Underground path-finding machine is factually correct, but for reasons I don't understand its paths are sometimes the fastest even when every Londoner (i.e. me) knows they shouldn't be.
</p>

<p>
<a href="slides 12 binheap.pdf">heaps</a> (as in heapsort) a wonderful data structure, that I recommend to all.
</p>