Differences
This shows you the differences between two versions of the page.
| courses:cs211:winter2012:journals:richard:chap5 [2012/03/15 03:57] – created marmorsteinr | courses:cs211:winter2012:journals:richard:chap5 [2012/03/15 03:58] (current) – marmorsteinr | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====Chapter 5==== | ====Chapter 5==== | ||
| + | ==5.1== | ||
| This section introduces the idea of Divide and Conquer, and recurrence relations. Divide and Conquer algorithms generally reduce existing polynomial time algorithms to better polynomial time. Mergesort is an example of divide and conquer, it's recurrence relation is T(n) <= tT(n/2) + cn. You can assume imprecisely that n is even, if it helps. You can " | This section introduces the idea of Divide and Conquer, and recurrence relations. Divide and Conquer algorithms generally reduce existing polynomial time algorithms to better polynomial time. Mergesort is an example of divide and conquer, it's recurrence relation is T(n) <= tT(n/2) + cn. You can assume imprecisely that n is even, if it helps. You can " | ||
