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 ...

It covers basic algorithm design techniques such as divide and conquer, dynamic ... (NP-completeness) . Learning Outcomes. Describe basic algorithm design techniques. Create divide and conquer, ...