CST 370 Week 1

This week has been a very fun 1st week. The lectures were very informative, and it’s been fun writing programs after doing designs and research for the past couple of weeks. In this week’s module I learned about different approaches to GCDs. In my learnings I used prime factorization, but learning Euclid’s algorithm helps to simplify and actually write a program for this. A prime factorization program would be very inefficient. I knew of the sorting and searching algorithms that were taught this week, I did learn the difference between a stable and unstable algorithm, that is a concept I hadn’t seen before. Data structures were a nice refresher and so were the graphs. The puzzles were also really fun. I got the Palindrome and Choosing Balls puzzle right on the first try, but the coins I did not. It was interesting to learn there was another approach that could accomplish the same task in fewer tries. Overall, I would say this was a good week and I am looking forward to next week.