Greedy -

: At every step, the algorithm selects the option that looks best in the current moment without considering future consequences.

: Every choice must satisfy the problem's constraints to be part of the solution. Greedy

Greedy strategies are highly effective for specific optimization problems where the greedy choice property holds true: 12. Greedy Algorithms: Minimum Spanning Tree : At every step, the algorithm selects the

: A problem has this property if an optimal solution to the entire problem contains within it optimal solutions to its sub-problems. Common Applications : At every step