CST370 Week 2

This week, I deepened my understanding of algorithm analysis by studying asymptotic notations, including Big-O, Big-Ω, and Big-Θ, and applying them to both recursive and nonrecursive algorithms. I practiced solving recurrence relations using backward substitution and worked through example problems and puzzles like the 4-gallon water challenge. I also learned about brute force as a problem-solving paradigm and how it applies to algorithm design. Overall, this week strengthened my ability to evaluate algorithm efficiency more systematically.

Comments

Popular posts from this blog

CST Module 4 January 29th - February 4th

CST300 Module 1 January 8th - January 14th

CST Module 3 January 22nd - January 28th