Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Dynamic Programming: Coin Change
Description
This lecture introduces dynamic programming as a method to solve the coin change problem efficiently. It contrasts the limitations of the greedy algorithm with the systematic exploration of all possible paths provided by dynamic programming. The instructor explains the recursive nature of dynamic programming and demonstrates its application in solving the coin change problem step by step, emphasizing the importance of exploring different paths to find the optimal solution.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.