$O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
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