C++: Greedy Algorithms vs Dynamic Programming

What are the main differences between greedy algorithms and dynamic programming?

Greedy algorithms make the locally optimal choice at each step, while dynamic programming solves problems by breaking them down into simpler subproblems and storing their solutions.

Can you give an example of a problem suited for each approach?

Sure! The Knapsack problem is often solved using dynamic programming, while the Activity Selection problem is a classic example of a greedy algorithm.

When should I choose dynamic programming over greedy algorithms?

Choose dynamic programming when the problem has overlapping subproblems and optimal substructure, which greedy algorithms may not satisfy.

Are there any performance differences between the two?

Yes, greedy algorithms are usually faster with lower time complexity, but they may not always yield the optimal solution, unlike dynamic programming.