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

: 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, the algorithm selects the

: Once a choice is made, it is final and never reconsidered. : At every step

Greedy strategies are highly effective for specific optimization problems where the greedy choice property holds true: 12. Greedy Algorithms: Minimum Spanning Tree