Welcome to the Unit webpage of the first year Algorithms unit!
Teaching Staff
Teaching Sessions
|
Week | Topic | Slides | |
---|---|---|---|
W13: 13 - 17 Jan Problem Sheet 1 PDF solution | Introduction | ||
Peak Finding | |||
Why Constants Matter Less | |||
Big-O Notation | |||
W14: 20 - 24 Jan Problem Sheet 2 PDF solution | Theta and Omega Notation | ||
RAM Model and Runtime Analysis | |||
W15: 27 - 31 Jan Problem Sheet 3 PDF solution | Linear and Binary Search | ||
Recap: Proofs by Induction | |||
Loop Invariants and Insertionsort | |||
W16: 03 - 07 Feb Problem Sheet 4 PDF solution | Mergesort | ||
The Maximum Subarray Problem | |||
W17: 10 - 14 Feb Problem Sheet 5 PDF solution | Trees | ||
Heapsort | |||
W18: 17 Feb - 21 Mar | |||
W19: 24 - 28 Feb Problem Sheet 6 PDF solution | Quicksort | ||
Runtime Analysis of Quicksort | |||
Lower Bound for Sorting | |||
W20: 03 - 07 Mar Problem Sheet 7 PDF solution | Countingsort and Radixsort | ||
Recurrences 1 | |||
W21: 10 - 14 Mar Problem Sheet 8 | Recurrences 2 | ||
Fibonacci Numbers | |||
W22: 17 - 21 Mar | |||
W23: 24 - 28 Mar | |||
W24: 31 Mar - 04 Apr | Revision Week, no new material |