Differences

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

Link to this comparison view

Both sides previous revision Previous revision
cs-312:hw16 [2014/12/31 23:27]
ringger
cs-312:hw16 [2015/02/19 05:34] (current)
ringger
Line 11: Line 11:
 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. 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?
cs-312/hw16.txt ยท Last modified: 2015/02/19 05:34 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0