Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:bairdc:chapter6 [2018/03/27 03:45] – [6.3 – Segmented Least Squares: Multi-way Choices] 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: | ||
| Line 32: | Line 34: | ||
| There is a sort-of chicken and egg relationship between subproblems and recurrences in dynamic programming. It isn't clear that a collection of subproblems will be useful until you find the linking recurrence. However, it can also be difficult thinking about recurrences without their subproblems. | There is a sort-of chicken and egg relationship between subproblems and recurrences in dynamic programming. It isn't clear that a collection of subproblems will be useful until you find the linking recurrence. However, it can also be difficult thinking about recurrences without their subproblems. | ||
| + | |||
| + | Overall I'd give this section a 10/10 on readability and a 8/10 on interestingness. | ||
| ===== 6.3 – Segmented Least Squares: Multi-way Choices ===== | ===== 6.3 – Segmented Least Squares: Multi-way Choices ===== | ||
