Description: and the greedy algorithm, the dynamic programming, can be a solution to the problem as the result of a series of policy decisions. The difference is that the greedy algorithm, each using a greedy norms will make an irrevocable decision, and the dynamic programming, it is also necessary to study each optimal decision whether sequence contains an optimal sequences.
To Search:
- [huisu] - retrospective (b a c k t r a c k i n g)
File list (Check if you may need any files):
Download