This week was even more trees! But we covered some trees that I hadn't worked with before, like the 2-3 tree, which I think became my new favorite tree of the moment.
This week's homework was tough, but a lot of fun. It took a couple of more revisions than I thought to be able to correctly pass all the test cases, especially additional test cases other students created. But it was a fun challenge to force you to think through and really analyze the max heap algorithm and hash table algorithms. I think it really helped reinforce the learning.
One area I'm hoping we get to explore more is more direct practical application of some of these topics learned in the class thus far. I know it's hard with time being so compact, but I think seeing more real world utilization of the algorithms, trees, techniques is always insightful and helps to cement the knowledge.
0 comments:
Post a Comment