← Back

πŸ“… Non-Overlapping Schedule Hall

Activity Selection - Greedy by Finish Time

Total Activities

-

Selected

0

Skipped

0

Last Finish

0

Step

0
Generate activities and find maximum non-overlapping set!

πŸ“– Activity Selection

Greedy Strategy: Sort activities by finish time (earliest first)

β€’ Select first activity

β€’ For each next: if start β‰₯ last finish, select it

Why Greedy Works: Earliest finish leaves most room for others

Time: O(n log n)