How the greedy paradigm of algorithm differ from that of dynamic algorithm?
Answers
Answered by
1
Explanation:
Greedy algorithm have a local choice of the sub-problems whereas Dynamic programming would solve the all sub-problems and then select one that would lead to an optimal solution. Greedy algorithm take decision in one time whereas Dynamic programming take decision at every stage.
Answered by
2
Answer:
Explanation:
Greedy algorithm have a local choice of the sub-problems whereas Dynamic programming would solve the all sub-problems and then select one that would lead to an optimal solution. Greedy algorithm take decision in one time whereas Dynamic programming take decision at every stage.
Similar questions