Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:patelk:chapter6 [2018/03/26 16:41] – [6.3 Segmented Least Squares: Multi-way Choices] patelk | courses:cs211:winter2018:journals:patelk:chapter6 [2018/03/26 16:42] (current) – [6.3 Segmented Least Squares: Multi-way Choices] patelk | ||
|---|---|---|---|
| Line 157: | Line 157: | ||
| * Takes O(n) for each j -> total of O(n²) | * Takes O(n) for each j -> total of O(n²) | ||
| * Runtime is O(n²), once all error values have been determined. | * Runtime is O(n²), once all error values have been determined. | ||
| + | |||
| + | ==== Personal Thoughts ==== | ||
| + | |||
| + | The section did a really good job laying out the algorithms in a way that was easy to follow. I think the least squares problem is also inherently easier to understand because we have worked with similar problems in math classes before. Overall, I think the algorithms and the data structures needed to solve this problem are pretty intuitive. | ||
| + | |||
| + | Readability: | ||
| + | Interesting: | ||
| + | |||
| + | |||
| + | ---- | ||
| + | |||
