# Dynamic programming VS Greedy Algroithms [closed]

I have two True or False questions in my practice test that are related but I am unsure about:

1. If an optimization problem can be solved using a greedy algorithm,
there must be a solution for this optimization problem using dynamic programming as well.

2. If an optimization problem can be solved using dynamic programming,
there must be a solution for this problem using a greedy algorithm as well.


I think the answers are 1. True and 2. False is this correct?

-

## closed as unclear what you're asking by D.W., David Richerby, Juho, vonbrand, Wandering LogicApr 14 at 17:37

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question.If this question can be reworded to fit the rules in the help center, please edit the question.

Does the course have any particular formal definition of "greedy algorithm" and "dynamic programming" in mind? –  Yuval Filmus Apr 7 at 1:50
What are your thoughts? What effort have you made on your own? What aspects of the question have you confused or uncertain about how to answer? Are there any aspects of dynamic programming and/or greedy programming that you are fuzzy about? –  D.W. Apr 7 at 6:53
Along the same lines I have the question True or False Dynamic programming requires that the optimization problem has a recursive solution? any input there? –  Deekor Apr 7 at 3:31