1/11/14

Greedy Algorithms.

Algorithms used to solve optimalization problems usually are about making decisions in sequence - at each step there's one decision to select from many possible choices.

Dynamic programming for many such problems is an overkill; there are simpler and more effective algorithms.

Greedy algorithm performs always the task that seems at a given moment most beneficial. It selects locally optimal decision in hope of it leading to most effective solution globally.

Source: [4].

No comments:

Post a Comment