Algorithm

computation

Definition

Algorithm

An algorithm for a problem $\mathcal{P}$ is a well-defined description of computational steps that allows us to solve an arbitrary instance of $\mathcal{P}$.

An algorithm has to be applicable on all instances of a problem, terminate after a finite number of steps, and return a correct result for the given problem.

Greedy

Definition

Greedy Algorithm

An algorithm is called greedy if it constructs a solution incrementally using a local criterion, without foresight, to select the next solution component to be added.

Link to original