CST 370 Week 3

This week was a lot of fun and I really enjoyed the material we covered. This is the first time I had ever seen the BFS and DFS algorithms explained the way they were in this class,  that helped me understand them a lot more. I struggled with these algorithms in previous classes, and I thought I would struggle again this week, but they were explained very well and I am very thankful for that. The finger puzzle was also fun, but it did teach me to slow down and read, because I was very wrong in my first attempt and I realized why when I went back and read the fingers were not consistent 

I had never heard of the Master Theorem before, so that was an interesting concept to learn. At first it was a little hard to grasp, but after working through examples, I could understand how it makes determining time complexity much easier. The knapsack search was probably the easiest concept for me to learn this week. I found it easy to follow, and it was nice to have a topic that  I grasped fairly quickly. Overall, I thought this was another enjoyable week, and I feel like I have a much stronger understanding of graph algorithms and recursive analysis than I did before.