Every two-year-old knows the greedy algorithm. In order to get what you want, just start grabbing what looks best.
Specifications: A very select number of optimization problems can be solved using a greedy algorithm. Most of these have the following form.
Precondition: We are given one of the following instances.
Instances: An instance consists of a set of objects and a relationship between them. Think of the objects as being prizes that you must choose among.
Postcondition: Given an instance, the goal is to find one of the valid solutions for this instance ...