It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms ... We will introduce the concept of dynamic programming using a simple example of ...

This is the key difference between dynamic programming and simple recursion: a dynamic programming algorithm memorizes the solutions of optimal subproblems in an organized, tabular form (a dynamic ...