$O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ words
(Keep track of answers to O(n^2) subproblems (i, j))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1953