STRATEGY GREEDY

Solution

for to n do

SELECT the next input x.

If Solution is FEASIBLE then

solution COMBINE(Solution, x)

• SELECT appropriately finds the next input to be considered.
• A FEASIBLE solution satisfies the constraints required for the output.
• COMBINE enlarges the current solution to include a new input.

Examples: Max finding, Selection Sort, and Kruskal's Smallest Edge First algorithm for Minimum Spanning Tree.