Greedy algorithm

The greedy algorithm is a problem solving meta-heuristic which makes the locally optimum choice at each stage with the hope of finding the global optimum. For instance, applying the greedy stragtegy to the traveling salesman problem yields the following algorithm: "At each stage visit the city nearest to the current city". Greedy algorithms rarely find the optimal solution consistently, but they are fast and often give good approximations to the optimum.