Greedy Algorithm - Reading Compherensive

shahar

Full Member
Joined
Jul 19, 2018
Messages
508
What the meaning of candidate set?
It appears in the first component of Greedy Algorithm in Wikipedia.
At:

Happy New Year!
[The time when the World Was Created by God by the Jewish Bible [[but I don't a religious guy, but my parents indeed. so I celebrated it]
 
This approach finds a solution by constructing a set of items. At each step the items 'collected' so far is called the candidate set. E.g. the set of coins in the change problem or the set of cities visited so far in the travelling salesman problem.
 
This approach finds a solution by constructing a set of items. At each step the items 'collected' so far is called the candidate set. E.g. the set of coins in the change problem or the set of cities visited so far in the travelling salesman problem.
I still not understand, sorry.
I point out the things that I don't understood:
1. What the meaning of constructing a set of items? What are the conditions need to be for given to do it?
2. Why it call candidate? It there another expression or meaning?
3. Can you emphasized the examples you give by a paragraph on every example that go give in details?

Thanks to you or for all the users that replay this replay.
Happy New Year.
 
Hi shahar,
there are many websites describing this method. Could you take a look at some of them and then let us know if something is not clear?
Even the article you linked describes a couple of examples (the ones I mentioned).

Thanks
Lev
 
What the meaning of candidate set?
It appears in the first component of Greedy Algorithm in Wikipedia.
At:

Happy New Year!
[The time when the World Was Created by God by the Jewish Bible [[but I don't a religious guy, but my parents indeed. so I celebrated it]
Happy Yom Kippur to you too!

Have you looked at other papers and videos available in the internet on this topic?
 
Can I define for intuitive definition to Greedy Algorithm:
Greedy Algorithm = the best algorithm that used in best way ("optimum way").[Is the word optimum is adv. (?!)]
I think I need to elaborate the definition and define the best way as:
best way to use an algorithm = using the least time and space for all the steps of the algorithm (input, output and processing)

Am I right?

And still I don't understand the meaning of candidate set?
Why the word is candidate?

And,
Now We in Sokut Holiday, the structures the people that escape from Egypt built in the dessert, that characterized by its temporary of them.

Yom Kippur isn't a really holiday by the real meaning. Yes, It a holy day, but the purpose of it Is To Ask for Forgiveness from God by FASTING from eve of Yom Kippur to the Evening of the next day.
And You need to ask for forgiveness for your relatives, neighbors and friends De Jure but as I know the Israeli that only fast, I don't remember anybody asking for forgiveness from me or anybody I met, so that depended on the sole person who do it.

So, Don't be wrong. the correct blessing for Yom Kippur is feel easy when you fasting. And I don't call it a holiday.

Happy Sokkut
 
Can I define for intuitive definition to Greedy Algorithm:
Greedy Algorithm = the best algorithm that used in best way ("optimum way").[Is the word optimum is adv. (?!)]
I think I need to elaborate the definition and define the best way as:
best way to use an algorithm = using the least time and space for all the steps of the algorithm (input, output and processing)

Am I right?

And still I don't understand the meaning of candidate set?
Why the word is candidate?

I think considering an example would help. Let's take one from the linked article. What's the minimum number of coins to represent 36 cents using only coins with values {1, 5, 10, 20}.
Can you follow the steps using this rule: "The coin of the highest value, less than the remaining change owed, is the local optimum"?
 
Top