Dynamic Programming (Change-Making Problem Change-Making Problem)

From Algorithm Wiki

Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Dynamic_Programming_(Change-Making_Problem_Change-Making_Problem)&oldid=44485"