answersLogoWhite

0

Both solve problem by dividing prob into sub-problems

(1)but in DP the sub problems are not independent where as in d&c the sub problems are independent of each other

(2)DP solves the sub problem only once and then stores it in table whereas D&C does more work on the sub problems and hence has more time consumption.

User Avatar

Wiki User

16y ago

What else can I help you with?

Related Questions

Is quick sort is an example of dynamic programming algorithm?

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


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 the difference between static and dynamic programming?

in static programming properties, methods and object have to be declared first, while in dynamic programming they can be created at runtime. This is usually due to the fact that the dynamic programming language is an interpreted language.


What is the difference between backtracking and dynamic programming?

The only difference between dynamic programming and back tracking is DP allows overlapping of sub problems. (fib(n) = fib(n-1)+ fib (n-2)).


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 the difference between greedy algorithm and dynamic programing?

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.


What is difference between linear and dynamic programming?

Dynamic programming (DP) has been used to solve a wide range of optimizationproblemsWhen solving a problem using linear programming, specific inequalities involving the inputs are found and then an attempt is made to maximize (or minimize) some linear function of the inputs.


What is difference between dynamic and volumetric compressor?

what is difference between dynamic and volumatic compressor


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.