What is Greedy Algorithm... in plain English?

Question

I'm doing this Traveling Salesman problem and ....it has to do with the Greedy Algorithm....is there an equation for this...

can someone explain this in plain English?

Answer 1

Greedy algorithms, in general, just make the best local decision without concern for how it might affect the overall problem. So, for the greedy Traveling Salesman, at each step, he'll take the cheapest leg of the journey even though, overall, this probably won't give an optimal answer. Actually, I just checked and there is a Wikipedia page on Greedy Algorithms and there is actually an example with the Traveling Salesman. Check the link below. Good luck...

Answer 2

i think it has to do with the waterfilling problem. it can also be called greedy optimization. basically you have a number of different buckets corresponding to different levels or frequencies, and each bucket has a certain objective function with which you decide how much to give to each bucket. the more space a bucket has, the more the greedy algorithm will use it. thus it is greedy.

Answer 3

The "at the same time as" statements ought to probable have some indication of what's being repeated for all and sundry... without them, the set of rules must be doing something. nonetheless, i think of it truly is dealing with a correct checklist, and removing reproduction entries - the place reproduction entries are entries with their information fields containing an analogous records.

Answer 4

It means the you make a decision based upon local information. For example, if you come to a junction then you only use the junction values to decide. You don't use any other information.