A greedy algorithm can be used to solve all the dynamic programming problems.

A greedy algorithm can be used to solve all the dynamic programming problems. Correct Answer False

A greedy algorithm gives optimal solution for all subproblems, but when these locally optimal solutions are combined it may NOT result into a globally optimal solution. Hence, a greedy algorithm CANNOT be used to solve all the dynamic programming problems.

Related Questions

Find out whether there is any grammatical error in below sentence.
Mahatma Gandhi did not solve / all the problems of the future / but he did solve / problems of his own age.