Saved Bookmarks
| 1. |
What Is A Greedy Algorithm? Give Examples Of Problems Solved Using Greedy Algorithms.? |
|
Answer» A GREEDY algorithm is any algorithm that makes the local optimal choice at each stage with the hope of finding the global OPTIMUM. A classical problem which can be solved using a greedy STRATEGY is the traveling SALESMAN problem. Another problems that can be solved using greedy algorithms are the graph coloring problem and all the NP-complete problems. A greedy algorithm is any algorithm that makes the local optimal choice at each stage with the hope of finding the global optimum. A classical problem which can be solved using a greedy strategy is the traveling salesman problem. Another problems that can be solved using greedy algorithms are the graph coloring problem and all the NP-complete problems. |
|