Rod-Cutting Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 22: | Line 22: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Rod-Cutting Problem - Time.png|1000px]] | [[File:Rod-Cutting Problem - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Rod-Cutting Problem - Space.png|1000px]] | [[File:Rod-Cutting Problem - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Rod-Cutting Problem - Pareto Frontier.png|1000px]] | [[File:Rod-Cutting Problem - Pareto Frontier.png|1000px]] | ||
Revision as of 13:05, 15 February 2023
Description
Given a rod of length $n$, and prices $p_i$ for which one can sell a segment of the rod of length $i$ ($1 \leq i \leq n$), find the splitting of the rod for which one can earn the most money once they sell the rod segments produced.
Parameters
n: length of rod
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Brute Force | 1940 | $O(n*{2}^n)$ | $O(n)$ | Exact | Deterministic | |
| Dynamic Programming | 1953 | $O(n^{2})$ | $O(n)$ | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
