欲よく張ばり法ほう

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.