Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:donohuem:chapter6 [2018/03/27 00:28] – donohuem | courses:cs211:winter2018:journals:donohuem:chapter6 [2018/03/27 01:05] (current) – donohuem | ||
|---|---|---|---|
| Line 26: | Line 26: | ||
| The iterative algorithm also has a runtime of O(n). Both algorithms are dynamic because the divide the main problem into subproblems and then combine computed subproblems to solve the overall problem. The readability of this sections is 8/10. | The iterative algorithm also has a runtime of O(n). Both algorithms are dynamic because the divide the main problem into subproblems and then combine computed subproblems to solve the overall problem. The readability of this sections is 8/10. | ||
| + | |||
| + | |||
| ===== 6.3 Segmented Least Squares ===== | ===== 6.3 Segmented Least Squares ===== | ||
| + | The problem arises out of best fit lines. Given a set of points, draw lines that best fit the points, or more formally with minimum error. When the points are not neatly arranged. Obviously, if we wanted the best accuracy, we could draw a line for each point. This, however, is not a helpful solution. | ||
