Week 59

This week, we discussed new sorting, counting, and radix sorting. Then we went over Dynamic Programming, which is a concept I've heard a lot throughout my CS career, but I've never really known what it meant until now. I'm glad ot be able to use and apply it because of this course. The Warshall and Floyd Algorithms were interesting to learn about. I shared a great visualization of the Algorithm in the class Discord for my group discussion participation. I'm always excited when I'm able to solve the puzzles because these puzzles are difficult and really get my mind going. The one I did solve was the Tall-Short puzzle, which is one of the easier ones, but I'm still happy with it. The quiz and homework were long and hard to do, but I'm glad I was able to wrap them up to prepare for the final.

Comments

Popular posts from this blog

Week 11

Week 12

Week 9