Week 10

During this week, the main topic we have dealt with is big-oh and sorting. Big oh notation was something that coincide with the materials covered in csc165. In csc165, I got a chance to see how to prove the big oh(upper bound), lower bound and tight bound. This background knowledge helped me somehow understand this week's material in csc148. This topic was interesting because we got a chance to see runtime of the multiple kinds of sorting algorithms. Apart from this, we had assignment part 2 due on Thursday. The assignment part 2 was about the regular expressions. In part 1 last time, we wrote a class RegexTree and other subclasses that inherits the characteristic of the RegexTree. This time, in part 2, we dealt with string representations and tree representation of the regular expressions. We mainly worked on how to break down a string with its key character. My partner and I struggled how to split the string at the right position; the multiple number of brackets in the regex string representation was an obstacle. Though, once we've figured out a proper algorithm to break down the string representation, the rest of the assignment was not as hard.