How is dynamic programming different from greedy algorithms?

Question

In the book I am using Introduction to the Design & Analysis of Algorithms, dynamic programming is said to focus on the Principle of Optimality

Answer 1

Greedy method:

1. Greedy method focuses on expanding partially constructed solutions.
2. It provides many results such as feasible solution.
3. More efficient

Dynamic programming:

1. Focuses on principle of optimality.
2. It provides specific answers.
3. Less efficient