6. A greedy algorithm can be used to solve all the dynamic programming problems.
a) True
b) False
Answers
Answered by
0
Answer:
False
Explanation:
Because greedy solution doesn't guarantee optimal solution.
Similar questions