noun
greedy algorithm
A mathematical term for an algorithm that makes the locally optimal choice at each step. Also known as 貪欲法.
See also: 貪欲法
欲張り法は、各段階で最善の選択をするアルゴリズムです。
The greedy algorithm is an algorithm that makes the best choice at each step.
Compound of 欲張り (よくばり, 'greedy') and 法 (ほう, 'method, algorithm'). The term is a direct translation of the English 'greedy algorithm'.