Algorithms and Programming. This information is for the 2019/20 session. ... Basic toolkit for the design and analysis of algorithms, and an in-depth study of sorting algorithms: Running time, ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Algorithms and Programming. This information is for the 2018/19 session. ... Basic toolkit for the design and analysis of algorithms, and an in-depth study of sorting algorithms: Running time, ...