This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms ...

CLRS has a helpful appendix but the student unfamiliar with these concepts can find numerous high quality explanations online. Programming Background: The course involves solving programming ...

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...