Week 55 (2/18/2026 - 2/24/2026)

       (Click on READ MORE for better formatting)

    Hi everyone, welcome to my 55th blog! This is the Week 7 post for CST 370 Design and Analysis of Algorithms.
  • Weekly learning journal relevant to this week's module. (50 words)
    • I would say week 7 is the first week that exclusively covered material that I have truly never seen before. Before my studies this week, my knowledge on counting sort, radix sort, dynamic programming, and the algorithms of Warshall, Floyd, and Prim were nearly non-exisitent. I had heard about "greedy technique" in the past but never fully understood what that entailed. Therefore, I would consider most of this week to be challenging, and definitely the most challenging week of this course.
    • There was also a homework assignment this week that tasked me to write two programs:
      • 1. Write a program to collect maximum number of coins on a n x m board which was covered in the class.
        • To solve this problem, I leveraged the Dynamic Programming (DP) technique.
      • 2. Write a program that implements the Floyd algorithm to display all-pairs shortest paths as we covered in the class. 
        • Solving this problem reminded me that it is possible to accomplish so much with so little. By leveraging agentic programming, it pointed me to a direction where I could implement the floyd algorithm directly in the main method, followed by printing the finalized matrix. While this is definitely not good coding practice in general, for the purpose of this assignment I would consider it perfectly acceptable.
    • Finally, I also contributed this video to our course's official Discord server: https://www.youtube.com/watch?v=cplfcGZmX7I. I also attended Kahnh's (TA) office hours.

    That is all for this week, see you in my Week 56 post!

Comments

Popular posts from this blog

Week 32 (8/13/2025 - 8/15/2025)

Weeks 41 - 48 (10/26/2025 - 12/19/2025)

Week 24 (6/18/2025 - 6/22/2025)