{A}
All lessons

Greedy Algorithms

7 min · Elixir examples

Make the locally best choice at each step when that strategy is safe.

Examples in:PythonJavaScriptTypeScriptJavaC++CC#KotlinGoOCamlRubyPHPDartElixirRustScalaSwift
Elixir · Greedy Algorithms0/5 cleared

Enemy 1 of 5

Greedy algorithms pick the best-looking option right now without backtracking. They work when a local optimum leads to a global optimum — like giving the largest coin first in change-making with standard denominations.

You
Bug Slime
Loading editor…
Sign up to fightThis one runs on our servers, so it needs a free account.

Stuck? Ask Rena

Your AI tutor that gives assistance.

Asking Rena in lessons is on Ultimate.

Ask Rena with Ultimate