A greedy algorithm can be used to solve all the dynamic programming problems.
|Answer» B. false|
|Explanation: 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.|
Login to Continue
It will take less than 2 minutes