This week I learned and reviewed core algorithm concepts that will be used throughout the course, including what algorithms are, how they are designed, and how their efficiency is analyzed. Euclid’s GCD algorithm helped reinforce breaking problems into clear logical steps. I also refreshed my understanding of pseudocode, time complexity, and Big O notation. Reviewing data structures like stacks, queues, trees, and graphs highlighted how closely algorithms and data structures are connected.