Greedy Algorithm

follows a problem solving heuristic of locallly optimal choice at each stage
Components:
- candidate set
- selection function
- feasibility function
- objective function
- solution function
at every strp makes optimal choice and move on to next step