What are the difference between greedy method and dynamic programming

Greedy method	Dynamic programming
(i) Greedy method is used for obtaining optimum solution.	(i) Dynamic programming is also for obtaining optimum solution.
(ii) Only one decision sequence is ever generated.	(ii) Many decision sequence may be generated.
(iii) In greedy method, the optimum selection is without revising previous by generated solutions.	(iii) Dynamic programming considers all possible sequence in order to obtain the optimum solution.
(iv) In Greedy method, a set of feasible solutions and the picks up the optimum.	(iv) There is no special set of feasible solution this method.
(v) In greedy method, there is no as such guarantee of getting optimum solution.	(v) It is guaranteed that the dynamic programming will generate optimal solution using principle of optimality.