Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:bairdc:chapter6 [2018/03/27 03:45] – [6.2 – Principles of Dynamic Programming: Memoization or Iteration over Subproblems] bairdc | courses:cs211:winter2018:journals:bairdc:chapter6 [2018/03/27 03:46] (current) – [6.1 – Weighted Interval Scheduling: A Recursive Procedure] bairdc | ||
|---|---|---|---|
| Line 24: | Line 24: | ||
| M-Compute-Opt(n) | M-Compute-Opt(n) | ||
| </ | </ | ||
| + | |||
| + | Overall, I'd give this section a 7/10 on readability and interestingness. | ||
| ===== 6.2 – Principles of Dynamic Programming: | ===== 6.2 – Principles of Dynamic Programming: | ||
