Question: What is the key difference between greedy algorithms and dynamic programming?

Options:

1. Greedy algorithms use recursion
2. Dynamic programming considers all possible solutions
3. Greedy algorithms are always optimal
4. Dynamic programming is faster

Correct Answer: Dynamic programming considers all possible solutions

Solution:

The key difference is that dynamic programming considers all possible solutions, while greedy algorithms make local optimal choices.