Editing Greedy algorithm (section)

==Types==
{{More citations needed section|date=June 2018}}
Greedy algorithms can be characterized as being 'short sighted', and also as 'non-recoverable'. They are ideal only for problems that have an 'optimal substructure'. Despite this, for many simple problems, the best-suited algorithms are greedy. It is important, however, to note that the greedy algorithm can be used as a selection algorithm to prioritize options within a search, or branch-and-bound algorithm. There are a few variations to the greedy algorithm:<ref>{{Cite journal |last=DeVore |first=R. A. |last2=Temlyakov |first2=V. N. |date=1996-12-01 |title=Some remarks on greedy algorithms |url=https://doi.org/10.1007/BF02124742 |journal=Advances in Computational Mathematics |language=en |volume=5 |issue=1 |pages=173–187 |doi=10.1007/BF02124742 |issn=1572-9044}}</ref>

* Pure greedy algorithms
* Orthogonal greedy algorithms
* Relaxed greedy algorithms