Greedy

Greedy algorithms make the locally optimal choice at each step, expecting it to lead to the globally optimal solution. Master reachability scanning, circular deficit tracking, greedy grouping, and partition extension to solve problems that reward choosing the best immediate option.