$O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (Keep track of answers to O(n) subproblems (cache), and sorted list of intervals) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference ==") |
(No difference)
|
Latest revision as of 12:17, 15 February 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ words
(Keep track of answers to O(n) subproblems (cache), and sorted list of intervals)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1953