answersLogoWhite

0

What else can I help you with?

Related Questions

What is the difference between greedy algorithm and Divide and Conquer?

greedy method does not give best solution always.but divide and conquer gives the best optimal solution only(for example:quick sort is the best sort).greedy method gives feasible solutions,they need not be optimal at all.divide and conquer and dynamic programming are techniques.


What are advantages of greedy method?

Greedy algorithms are simple to implement and easy to understand. They typically have a low time complexity, making them efficient for some problems. Greedy algorithms can provide quick solutions when the problem can be solved by making locally optimal choices.


What are advantages and disadvantages of greedy method?

It may not be the best solution and sometimes may even be the worst possible one.


What is the difference between branch and bound and greedy method?

Branch and bound method is used for optimisation problems. It can prove helpful when greedy approach and dynamic programming fails. Also Branch and Bound method allows backtracking while greedy and dynamic approaches doesnot.However it is a slower method.


Are mice greedy?

Yeah. They are greedy


Is Eminem greedy?

no eminem is not greedy...


Were greedy for more gold sentence or fragment?

The phrase 'were greedy for more gold' is a fragment. Who was greedy? Correct: The men were greedy for more gold. The miners were greedy for more gold.


How do you put greedy in a sentence?

You describe who is greedy. (the old man was very rich and greedy)


What part of speech is greedy?

Greedy is an adjective


How do you use the word greedy in a sentence?

Your so greedy!


Are bisexual s just greedy?

no. this is their choice. they are not greedy


Was Marco Polo greedy?

yes very greedy