Books we had laying around

• C by Dissection (3rd ed). AL Kelly and Ira Pohl. Addison-Wesley. The least incorrect book on C.
• The C Programming Language. Brian W Kernighan and Dennis M Ritchie. Prentice Hall. The book by the people who invented the (original) C. Has the major advantage of being small and cheap, but it is not so good for novice programmers.
• C: How to Program. Harvey M Deitel and PJ Deitel. Prentice Hall. Literally heavy, but goes very slowly which might be an advantage for some readers.
• The ANSI C standard.
• Understanding Algorithms and Data Structures. David Brunskill and John Turner. McGraw-Hill. Not too bad, contains Ada examples as well as C.
• The Design and Analysis of Computer Algorithms. Aho, Hopcroft and Ullman. Addison-Wesley. A classic book on algorithms for the devotee.
• Algorithms in C. Robert Sedgewick. Addison-Wesley. A semi-classic. Not much C, though.
• Introduction to The Design & Analysis of Algorithms. Anany Levitin. Addison-Wesley. A clear, well-written book that covers our syllabus well, though it goes into more depth.
• Data Structures, Algorithms & Software Principles in C. Thomas A Standish. Addison-Wesley. Handholding, with big pictures and lots of colour-coding to ensure you know which are the important parts.

Coursework Assignments

• This year's Assignments.

Lecture Notes

• Notes.

Handouts

• Sorting and Searching

Some Links

• The International Obfuscated C Code Contest
• The Underhanded C Contest
• The Complete Collection of Algorithm Animations
• Introduction to Algorithms course from MIT
• Analysis of Algorithms the first few lectures are useful
• Computational Complexity Theory description from Wikipedia
• Dictionary of Algorithms and Data Structures For example, see quicksort
• A book on algorithms.