Skip to content

Greedy 贪心

:material-circle-edit-outline: 约 64 个字

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.

The greedy algorithm does not produce an optimal solution in many cases, but only a local optimal solution that approximates a globally optimal solution in a reasonable amount of time.

Commonly applied problems

Travelling salesman problem

References