| 释义 |
greedy algorithm An umbrella term for any algorithm that makes the best choice at each term judged solely on the choices at that term and so may fail to be optimal overall. Such an algorithm may fail for the travelling salesman problem but does work to find Egyptian fractions, Huffman codes, and minimum cost spanning trees.
|