Dynamic Programming (Rod-Cutting Problem Rod-Cutting Problem)

From Algorithm Wiki

Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference ==")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ words

(easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dynamic_Programming_(Rod-Cutting_Problem_Rod-Cutting_Problem)&oldid=44483"