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
Greedy Change-Making Algorithm: Optimality and Stability
Description
This lecture covers the greedy change-making algorithm for U.S. coins, proving its optimality by using the fewest coins possible. It also explores the stability of maximum matching in the marriage problem, introducing the Gale-Shapley algorithm.
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.