Recall that Dynamic Programming consists of two parts:
Greedy Programming also consists of two parts:
A Greedy Algorithm starts with a locally-optimal choice, and continues making locally-optimal choices until a solution is found.