cst 370 - week 3- learning journal

This week deepened my understanding of how different algorithmic techniques work and how to analyze their efficiency. I learned how brute-force approaches can lead to worst-case behavior when repeated comparisons occur, and why smarter strategies are often needed. Graph traversal became clearer through understanding breadth-first search, which explores vertices level by level using a queue and guarantees the shortest path in terms of edges. I also gained insight into divide-and-conquer algorithms, where problems are recursively split into smaller subproblems and combined to form a solution. Finally, learning how to analyze recursive algorithms using recurrence relations and the Master Theorem helped me confidently determine time complexity without relying on lengthy expansions.

Comments

Popular posts from this blog

Week 2 Learning Journal 5 Parts

Week 4 Journal

BOOK REPORT EXTRA CREDIT