How does Dynamic Programming differ from Divide and conquer approach for solving problems? Can anyone explain the essential idea of Dynamic Programming.

Thanks for any help.


closed as off-topic by Sasho Nikolov, Mohammad Al-Turkistany, David Eppstein, Kaveh Oct 19 '13 at 10:35

This question appears to be off-topic. The users who voted to close gave these specific reasons:

  • "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – David Eppstein, Kaveh
  • "Questions on undergraduate-level computer science are off-topic here, but can be asked on Computer Science Stack Exchange. See also: What kind of questions are too basic?" – Sasho Nikolov, Mohammad Al-Turkistany
If this question can be reworded to fit the rules in the help center, please edit the question.


The answer is available online


Not the answer you're looking for? Browse other questions tagged or ask your own question.