Photo by Sharon McCutcheon on Unsplash

9. Greedy Algoritm

-

• How to choose the most reasonable answer in current situation.
• Mainly applied to combinatorial optimization problem with retraction search and dynamic programming

How to solve the problem by making the decisions that are best judged from the point of view up to now

Steps

1. Selection Procedure: A selection that selects one of the specific candidates to determine whether this is the solution to a given problem. In this case, the method of selecting the solution is the best one only in the current situation.
2. Feasibility Check: Checks whether the selected answer is valid.
3. Solution Check: Check that the solutions you have selected up to this time meet the requirements of the problem.