Learning to Think In Code

CST370 Module 2 Weekly Engagement  This week we dove deeper into algorithm efficiency, and how we can approach analyzing it using notation such as Big O, Big Theta, and Big Omega. I got more practice in finding the time complexity of an algorithm through pseudocode and recurrence relations for algorithms that included brute force methods and recursion. I also worked through algorithm puzzles such as finding the angle of the clock hands, and the racing car puzzle to provide better context to the theories rather than pure memorization. The quiz helped solidify my knowledge, while also testing it, allowing me to understand what I need to work on for future.