Brute Force (Rod-Cutting Problem Rod-Cutting Problem)
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