answersLogoWhite

0

A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage; instead a "greedy" choice can be made of what looks best for the moment.

User Avatar

Wiki User

16y ago

What else can I help you with?

Continue Learning about Engineering
Related Questions

Difference between greedy algorithm and dynamic programming?

the basic difference between them is that in greedy algorithm only one decision sequence is ever generated. where as in dynamic programming many decision sequences are generated.


What is difference between dynamic and volumetric compressor?

what is difference between dynamic and volumatic compressor


What are the difference between versions and functions?

Version: static reference to a specific entity of a specific instance. Function: dynamic reference to existing algorithm to perform or execute.


What is the difference between static and dynamic fighting?

Static stays the same and dynamic is always different.


What is the difference between a stable system and dynamic system?

lollssxx


What is Difference between static and dynamic list?

A static one cannot change, while a dynamic one can.


What is the general difference between a static IP and a dynamic IP?

The general difference between a static IP and dynamic IP is that a static IP is reserved and does not change. A dynamic IP on the other hand changes each time one logs on.


Why are they call Dynamical Systems as opposed to Dynamic Systems. What is the difference between the words Dynamic and Dynamical?

See What_is_the_difference_between_dynamical_and_dynamic


What is the difference between static pressure and dynamic pressure?

The main difference of static pressure and dynamic pressure is:- static pressure is exerted by fluid at rest but dynamic pressure is pressure exerted by fluid in motion.


Difference between static multiplier dynamic multiplier?

Type your answer here...


Is quick sort is an example of dynamic programming algorithm?

quick sort is a divide and conquer method , it is not dynamic programming


What are the difference between static and dynamic hashing in DBMS?

Search operation in static hashing is time consuming, but in dynamic hashing it is not.