View source for Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling)

← Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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

== Reference ==

Return to Brute force algorithm (Weighted Activity Selection Problem Interval Scheduling).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Brute_force_algorithm_(Weighted_Activity_Selection_Problem_Interval_Scheduling)"

Navigation menu