About this document
L16 Greedy by Sana is a document available to read on EtoBox.
Greedy algorithms are used to solve optimization problems by making locally optimal choices at each step, aiming for a globally optimal solution. They are effective in problems exhibiting the greedy-choice property and optimal substructure, such as the Fractional Knapsack and Minimum Spanning Tree problems. However, greedy algorithms do not always yield the best solution, which can often be achieved through dynamic programming.
- Author
- Sana
- Language
- EN