Activity Selection - Greedy by Finish Time
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)