Greedy algorithm

A heuristic algorithm that at every step selects the best choice available at that step without regard to future consequences. A greedy method never rescinds its choices or decisions made earlier. A greedy method is usually applied to an optimization problem for which the method attempts to determine an optimal solution (least cost, maximum value), with no guarantee that the optimal solution will be found. Kruskal's and Prim's minimum spanning tree algorithms are greedy methods that do produce an optimal solution. Algorithm; Heuristic procedure; Kruskal's algorithm; Prim's algorithm.