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.
Properties
Completeness
Greedy search is incomplete if there are loops. Otherwise, with loop checks, greedy search is complete.
Time Complexity
Let
Space Complexity
See time complexity.
Optimal
No.