First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling)

From Algorithm Wiki

Revision as of 08:57, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n+k)$? words (^see above) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n+k)$? words

(^see above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=First_come,_first_served_(Unweighted_Interval_Scheduling,_Online_Interval_Scheduling)&oldid=47050"