How do I solve greedy problems

  

 
The change problem is an example of a. Such problems can often be solved with a greedy strategy.  
requirement
 
The optimization problem can be solved by a series of decisions.  
example

(move the mouse over the money ...)
 

 

 
And the problem should have two fundamental properties for a greedy strategy:  
further requirements
 
  1. The property of:
    The solution to the optimization problem can be achieved by making each decision on the basis of one.
  2. The property of:
    The solution to the optimization problem 'contains' solutions to optimization tasks for sub-problems (of the same type as the initial problem).
 
example
 
 

 
One needs the quality of greedy choice so that it is even clear what constitutes a greedy decision in each step.
The property of the optimal substructure is needed to prove that the greedy strategy actually leads to a solution of the global optimization task. However, this evidence must be provided separately for each task.