Greedy Coin Change
In this class, we don't have to worry too much about why some greedy algorithms are optimal. The
examples I presented in class, namely coin change for US coin denominations, and interval
scheduling using earliest-deadline first are greedy optimal. This visual representation of
coin change may help you better understand why it's optimal for US coin denominations.
Type the amount in cents that you need change for and click submit