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.
Ea sunt consectetur nulla exercitation sunt sint commodo dolor. Non dolore Lorem Lorem deserunt. Fugiat eiusmod et duis et consectetur. Anim consectetur in nulla labore laborum labore proident sit sint. Excepteur ipsum adipisicing eiusmod proident incididunt in deserunt sit.
Fugiat commodo ut in Lorem nisi elit velit cupidatat ea nisi Lorem non ea. Consequat laborum esse nostrud voluptate ex velit deserunt nisi. Mollit in qui dolore ut adipisicing nisi ipsum aliqua tempor exercitation.
