Friday, September 7, 2018

1.1-1.2, due on September 7


Something I seem to struggle with is knowing how to count primitive operations. In particular, I'm not sure how Line 11 of Algorithm 1.2.1 costs as many as 5n operations. I find that it's also difficult to follow some of the algorithms without a visual aid of some kind.

All in all, sections 1.1 and 1.2 were relatively straightforward; having taken algorithm and data structure courses previously I appreciated the review. The intensity and depth of the mathematical elements has been a bit of a learning curve though.

No comments:

Post a Comment