Remember to Thank a member who answers your Question by Voting Up their answer.
You are viewing this forum as a guest therefore You are Not Allowed to Post and Reply and You are not allowed to view links.
Register or Login
0 Members and 1 Guest are viewing this topic.
A greedy algorithm is a mathematical process thatlooks for simple, easy-to-implement solutions tocomplex, multi-step problems by deciding whichnext step will provide the most obvious benefit.Such algorithms are called greedy because whilethe optimal solution to each smaller instance willprovide an immediate output, the algorithm doesn'tconsider the larger problem as a whole. Once adecision has been made, it is never reconsidered.Greedy algorithms work by recursivelyconstructing a set of objects from the smallestpossible constituent parts. Recursion is anapproach to problem solving in which the solution toa particular problem depends on solutions tosmaller instances of the same problem. Theadvantage to using a greedy algorithm is thatsolutions to smaller instances of the problem canbe straightforward and easy to understand. Thedisadvantage is that it is entirely possible that themost optimal
its an aspect of a course in took last semester in school. its about problem solving cycle, and greedy algorithm is just one if the numerous methods of solving a problem.