Question: what is difference between greedy method and dynamic programming?
Answer: Greedy algorithm is one which finds feasible solution at every stage with the hope of finding optimal solution whereas Dynamic programming is one which break the problems into series of overlapping sub-problems. ... Greedy algorithm take decision in one time whereas Dynamic programming take decision at every stage.