CST 370 Weekly Journal #1
Weekly Journal This week I learned about algorithm analysis concepts which included time and space complexity, Big-O notation, and finding basic operations in pseudocode. Furthermore, I practiced analyzing algorithms such as sequential addition and selection sort so I could learn more about them. However, I faced a few challenges learning about all these concepts like distinguishing between best-case or worst-case scenarios. I had to look over a lot of examples before I understood it. Still, eventually, I comprehended it by following some examples in the provided materials and it helped me understand the differences between them. In addition, I also tried my best to analyze pseudocode by identifying the basic operations. Working through the material, I went on to review some of the recorded lectures to help with solving homework problems I didn't quite get yet, especially for the questions that involved nested loops and quadratic time complexities. All in all, I think this was a gr...