Greedy
Definition
Link to originalGreedy Algorithm
An algorithm is called greedy if it constructs a solution incrementally, in which a local criterion is used, without foresight, to select the next solution component to be added.
Definition
Link to originalGreedy Algorithm
An algorithm is called greedy if it constructs a solution incrementally, in which a local criterion is used, without foresight, to select the next solution component to be added.