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

Greedy algorithms. Dynamic programming. Teaching. This course is delivered through a combination of seminars and lectures totalling a minimum of 30 hours across Autumn Term. There are also optional ...