We compare a greedy solution to the coin changing problem against the dynamic programming solution provided in the previous module. We study cases where greedy algorithms turn out to be optimal: ...

We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing ...

Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...