Brute Force (Rod-Cutting Problem Rod-Cutting Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n*{2}^n)$

Space Complexity

$O(n)$ words

(easily derived)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Brute_Force_(Rod-Cutting_Problem_Rod-Cutting_Problem)&oldid=44482"