tailieunhanh - Lecture Algorithm design - Chapter 4: Greedy Algorithms I
Lecture Algorithm design - Chapter 4: Greedy Algorithms I include all of the following: Coin changing, interval scheduling, scheduling to minimize lateness, optimal caching. | 4. Greedy Algorithms I coin changing interval scheduling scheduling to minimize lateness optimal caching Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne http wayne kleinberg-tardos Last updated on Sep 8 2013 6 30 AM 4. Greedy Algorithms I coin changing Coin changing Goal. Given currency denominations 1 5 10 25 100 devise a method to pay amount to customer using fewest number of coins. Ex. 34C. Cashier s algorithm. At each iteration add coin of the largest value that does not take us past the amount to be paid. Ex. .
đang nạp các trang xem trước