##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Classic unbounded example
Coin Change is Unbounded Knapsack in disguise. Given coins and amount , find the minimum number of coins. Let = minimum coins for amount .
Base case: . Transition: for each coin. , , , , , (using coins 3+3 or 4+1+1). This is "minimum count" rather than "maximum value", but the structure is the same. Unbounded items, capacity constraint, optimal selection.
