<p>The answer is available online</p>

<ul>
<li><p>You can read their description and comparisons on wikipedia:</p>

<ul>
<li><a href="http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm" rel="nofollow">http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm</a></li>
<li><a href="http://en.wikipedia.org/wiki/Dynamic_programming" rel="nofollow">http://en.wikipedia.org/wiki/Dynamic_programming</a></li>
</ul></li>
<li><p>You can watch Tim Roughgarden's videos about these two topics:</p>

<ul>
<li><a href="http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms" rel="nofollow">http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms</a></li>
</ul></li>
</ul>

CC BY-SA 3.0
2013-09-24T11:37:24.653Z
2013-09-24T11:37:24.653Z
J.y B.y
<p>How does Dynamic Programming differ from Divide and conquer approach for solving problems?
Can anyone explain the essential idea of Dynamic Programming.</p>

<p>Thanks for any help.</p>

CC BY-SA 3.0
2013-09-24T11:35:00.173Z
This is probably not a research level question: better ask it on [cs.se].
J.y B.y
CC BY-SA 3.0
2013-09-24T12:05:19.073Z
The difference is memoization. In addition to Tim's online lectures, another good resource is Jeff Erickson's lecture notes: http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/notes/05-dynprog.pdf
Sasho Nikolov
CC BY-SA 3.0
2013-09-24T16:45:22.697Z
Please see [about] and [help/on-topic] for information about the scope of [cstheory.se]. Remember that there is also [cs.se] which has a broader scope.
Kaveh
<dynamic-programming>
Dynamic programming and Divide and conquer approach
Stive
# Dynamic programming and Divide and conquer approach

(Asked by: username_0 on 2013-09-24)

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.

**Tags:** dynamic-programming

> **Comments:**
> **username_1**: This is probably not a research level question: better ask it on [cs.se].  
> **username_2**: The difference is memoization. In addition to Tim's online lectures, another good resource is Jeff Erickson's lecture notes: http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/notes/05-dynprog.pdf  
> **username_3**: Please see [about] and [help/on-topic] for information about the scope of [cstheory.se]. Remember that there is also [cs.se] which has a broader scope.  

---

## 1 answers

### Answer by username_1 on 2013-09-24. Score: 1 | Accepted answer

The answer is available online

* You can read their description and comparisons on wikipedia:

  + <http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm>
  + <http://en.wikipedia.org/wiki/Dynamic_programming>
* You can watch Tim Roughgarden's videos about these two topics:

  + <http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms>


---

