Greedy Algorithm: An iterative procedure that, at each step, selects the component offering the greatest immediate improvement in the approximation of an element.