This week the profs posted their design for regex, which was a bit different from my design. To be honest, I can't understand why he used a nested class in a nested class - if that is the right way to call it. I spend a lot of time on the exercise. I found the exercise a bit harder than the previous two. I had to went back to review how to approach in-order and pre-order trees. For the second part of the exercise, I think the ideas that people talked about on piazza helped a lot. I used a helper function and the rest of the code was not too hard.
During lectures, we talked about binary search tree and big-O. Binary search tree is very similar to binary search we talked about in CSC108, but in the form of tree with children. We also talked about big-O which is related to efficiency. I am also taking CSC165, and have found big-O not that bad to follow. Overall, this week was not too bad.
No comments:
Post a Comment