Stanford CS161 Lecture 14: When a Greedy Algorithm Turns Local Choices into a Global Optimum
A greedy algorithm is not merely 'pick what looks best.' It keeps one choice at each step and needs an exchange argument proving that the choice preserves an optimum. Lecture 14 develops that proof pattern through activity selection, weighted completion time, and Huffman coding.