Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
$O(n)$ words
(Need to keep track of which subset is being checked)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940