Top Down & Greedy Algorithms Algorithms between extremes – Efficient: Breadth First – Inefficient but Exact: Dynamic Programming Top Down is the reverse of Breadth First – Add best items first, then try to add prerequisites Greedy reasons about entire chains at once – Tries to add prefixes of chains with high avg score 10
{}