Divide-&-Conquer vs Dynamic-Programming (state differences b/w them in case of Algorithms) ?

Question

Subproblems are independent in case of D&C but subproblems are related (i.e. not independent) in case of DP -- that's all I know, but more points and explanation are needed. Any kind of help is appreciated.

Answer 1

imho we cant compare them..
devide n conquer is a term in programming, a concept not an algorithm.
it says that a big problem can be solved by devide it into smaller problems..
like when we make a online game, we can devide it into moduls like: GUI, AI, Game Engine, Editor, Connection Manager, Client, Server, etc

dynamic programming is an algorithm.
one of sugested solution to conquer the combination problem.
instead of searching all combination to propose the best solution, dynamic programing algorithm somehow use less iteration to search best solution.

serch the web for more detailed info.