This shows you the differences between two versions of the page.

Next revision | Previous revision | ||

cs-312:hw16 [2014/12/31 16:03] ringger created |
cs-312:hw16 [2015/02/18 22:34] ringger |
||
---|---|---|---|

Line 9: | Line 9: | ||

=== Question 1 === | === Question 1 === | ||

- | Now consider a coin system for which we know the greedy algorithm would fail to always provide optimal change: <math>d=[1,5,8]</math>. Show how to use dynamic programming to optimally make change for 10 units. | + | Now consider a coin system for which we know the greedy algorithm would fail to always provide optimal change: $d=[1,5,8]$. Show how to use dynamic programming to optimally make change for 10 units. |

+ | === Question 2 === | ||

+ | |||

+ | Yes or No: Did you read all of Section 6.3 in the textbook? |