Answer :
In greedy method, A locally optimal of solution is generated
Greedy algorithms
Greedy algorithms construct a solution piece by piece, selecting the next portion in such a way that it provides an immediate benefit.
This method never reconsiders earlier decisions. This method is most commonly used to tackle optimization problems. Greedy algorithms employ a problem-solving procedure to progressively build candidate solutions, to approximate the global optimum, by obtaining better and better locally optimal solutions at each stage.
The property states that the globally optimum solution may be determined by first determining the locally optimal solution (Greedy). A Greedy algorithm's decision may be influenced by previous decisions but not by future ones.
Globally Optimal Solution
A globally optimal solution is one where there are no other feasible solutions with better objective function values. A locally optimal solution is one where there are no other feasible solutions in the vicinity with better objective function values.
It makes one Greedy decision after another iteratively, reducing the given problem to a smaller one.
Greedy is an algorithmic paradigm that assembles a solution piece by piece, constantly selecting the next component that provides the greatest evident and immediate advantage.
In greedy method, A locally optimal of solution is generated
To learn more about Greedy Algorithm visit:
brainly.com/question/13197481
#SPJ4
