The labs seem to be getting progressively tougher each week and this week was no exception. I feel as though the distinction between a binary search TREE and a BSTNode were not demonstrated well through the tasks in the recent labs. My TA was pretty helpful though, giving hints to point us in the right direction but not spoiling the thought process.
Something about A2 part B. Using a combination of is_regex and all_regex_permutations is horribly inefficient and perhaps when marks have been given and released I would like to see a more optimal solution and the algorithm behind it. I would be interested in how it works.
No comments:
Post a Comment