5 replies to this topic

[Davide]

Hello,

I am supposed to learn for school the "Greedy" programming algorithm, it's just that i don't understand nothing from my school informatics manual.

Can anyone tell me how it works? With examples please?

Thank you very much.

[dcs]

Let me google that for you

[Davide]

dcs said:

Let me google that for you

When you do that, at least look at the results to see if their good for something before copy/pasting the url.

[dcs]

Davide said:

When you do that, at least look at the results to see if their good for something before copy/pasting the url.

I do. Your question was sufficiently vague as was my reply.

If you need help with something specific, I can't read your mind so you might want to mention something specific.

[edit]Let's see...

Davide said:

i don't understand nothing from my school informatics manual.

Well, in the search results several other 'manuals' were listed. Perhaps one of these is more suited to you.

Davide said:

Can anyone tell me how it works?

In the search results (obviously since other 'manuals' are listed), are explanations of how it works.

Davide said:

With examples please?

Several examples are listed in the search results with the explanations.

We've got descriptions, examples, and explanations all related to the greedy algorithm. If that's not what you are looking for, I have no idea what your question is asking.

[WingedPanther]

The greedy algorithm simply uses a measure (dependent on the problem at hand) to measure how much progress will be made by each possible option, and selects the one that will make the biggest gain at this step. It has known limitations, and is not guaranteed to provide an optimal solution.

Anything more specific requires a context for the problem being solved by the greedy algorithm. Of course, dcs's search results already said all that.

[Davide]

WingedPanther said:

The greedy algorithm simply uses a measure (dependent on the problem at hand) to measure how much progress will be made by each possible option, and selects the one that will make the biggest gain at this step. It has known limitations, and is not guaranteed to provide an optimal solution.

Anything more specific requires a context for the problem being solved by the greedy algorithm. Of course, dcs's search results already said all that.

Thank you, that answered my question. Wikipedia sucks sometimes.