This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: n . State and prove time complexity of your algorithm. 1 2. (10 points) Let A = { A 1 , . . ., A n } be a set of distinct coin types, where A 1 < A 2 < . . . < A n . The coinchanging problem is deFned as follows. Given an integer C , Fnd the smallest number of coins from A , that add up to C , given that unlimited number of coins of each type is available. Design an eﬃcientdynamicprogrammingalgorithmthatoninputs A and C , outputs the minimum number of coins needed to solve the coinchanging problem. State and prove time complexity of your algorithm. 2...
View
Full Document
 Fall '08
 UNGOR
 Algorithms, Dynamic Programming, Natural number

Click to edit the document details