Dynamic Programming (Change-Making Problem Change-Making Problem)
Jump to navigation
Jump to search
Time Complexity
$O(Sn)$
Space Complexity
$O(Sn)$ words
(Easily derived)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1953
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/321864.321874