Computer Science - Algorithms - Greedy algorithms - Greedy Algorithm Design

4 sections. Section 1 'What is Greedy?': At each step, make the locally optimal choice. Never reconsider past decisions. Hope that local optimal → global optimal. Much simpler than DP! But only works when 'greedy choice property' holds. Section 2 'When Greedy Works': Activity Selection: pick earlies