Lectures

Links below are to the handout versions of the lecture slides. The recordings can be accessed via Aoroa or [Echo360].

Note: Lecture titles/topics are subject to change. Note: Lecture links to pdfs will be added at least one day prior to the lecture.

1. L01_Introduction
2. L02_BasicUnionFind
3. L03_ImprovingUnionFind
4. L04_Induction1
5. L05_Induction2
6. L06_AnalysingRecursiveAlgorithms
7. L07_Mergesort
8. L08_RandomAlgorithms
9. L09_StacksQsHeaps
10. L10_MapSetsTrees
11. L11_BST
12. L12_BalancingBSTs
13. L13_Hashing1
14. L14_HashingProbing
15. L15_HashingApplications
16. L16_Graphs
17. L17_GraphPaths
18. L18_TwoProofs
19. L19_MinimumSpanningTree
20. L20_GreedyAlgorithms
21. L21_DynamicProgramming1
22. L22_DynamicProgramming2
23. L23_DynamicProgramming3
24. L24_PandNP
25. L25_Wrapup