LECTURE 22 OF 25
Greedy Algorithms
A greedy algorithm never looks back — it commits to the locally best choice at every step, and the whole challenge is proving that never backtracking still finds the global optimum.
Builds on
Best read after 6. Divide-and-Conquer Sorting, 20. Topological Sort, 21. Intervals — you can still read ahead, but some of this may lean on ideas covered there.