It covers basic algorithm design techniques such as divide and conquer ... decisions and compare them against a carefully considered but expensive strategy such as dynamic programming studied in the ...

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