The idea of greedy technique is the following: At every step you have a choice. Instead of evaluating all choices recursively and picking the best one, pick what looks like locally the best choice, and go with that. Recurse and do the same.

Is greedy Algorithm Dynamic Programming?

In Dynamic Programming, we choose at each step, but the choice may depend on the solution to sub-problems. 2. In a greedy Algorithm, we make whatever choice seems best at the moment and then solve the sub-problems arising after the choice is made.

Is greedy Algorithm Iterative?

Iterated greedy is a search method that iterates through applications of construction heuristics using the repeated execution of two main phases, the partial destruction of a complete candidate solution and a subsequent reconstruction of a complete candidate solution.