Ethan's Computer Science Journey

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.

 This week was a little rough because I had so much work. I am still in the process of tackling it, but I figured I'd get this out of the way. I even got called in on my day off, but we push. AVL, 2-3, and max heap trees are all new to me. But it was nice to see something pop up from my Data Structures & Algorithms course from back in the day. Hashing, it's probably my favorite data structure. I think it's super neat and unique. Handling collisions is also fun. I was so stumped on the puzzle this week, but then again,n I always am. After this class engagement, it's straight to the programming assignment for me.

 Week 5 begins just after the Midterm, and I did pretty well, so I'm happy with my performance. I also appreciate the midterm starting at 10am; the last class had us starting at 9am, and it was too early for me to think. This week was heavy lecture-wise, but I managed to get through it during the week. Homework 4.2 wasn't bad, but 4.1 was rough. I knew it would be bad when it said to use ChatGPT to debug. It was alot but I got through it. For my class participation, I will share a resource in the class Discord.