Assertion: greedy algorithm | /r/CapableOf | run over same set of data
Facets:
value: multiple times
type: TEMPORAL
Source sentences:
text: While a Greedy Algorithm is usually called naive, because it may run multiple times over the same set of data, Dynamic Programming avoids this pitfall through a deeper understanding of the partial results that must be stored to help build the final solution.