This lecture covers optimization problems, greedy algorithms, and the Cashier's Algorithm for finding the least total number of coins for a given amount. It also includes proofs of optimality for the change-making algorithm using U.S. coins.
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.
Amet esse aliquip enim tempor. Laboris cupidatat laborum sunt proident consequat deserunt. Et in minim dolore reprehenderit. Ex voluptate ullamco fugiat cillum fugiat eiusmod sit sint fugiat ullamco sunt anim.
