Sorting Algorithms and Time Complexity were the main topic for this week, which I found to be relatively easy. The sorts we discussed were all covered in 108 last year and Big O notation has been the topic in 165 for the last several weeks. It was good to get a fresh perspective on them, but nothing struck me as overtly complex or beyond quick understanding.
Also this week was the conclusion of Assignment 2. Regexes are an interesting format though not one I immediately see the practical use for. In theory however their ability to specify various binary representations and demonstrate applications of recursion and linked lists was very helpful to comprehension.
No comments:
Post a Comment