Greedy Decision Making

At each step choose the move that maximizes immediate progress toward feasibility.

Try this in Python

events = [(1, 10), (5, 7), (8, 9)]
print(max(events, key=lambda x: x[1] - x[0]))

Key takeaways

• Tie-break rules must be explicit.
• Lookahead 1 is still greedy; deeper is usually DP.
• Draw timeline for interval stories.