CST370 - Week 2
This week we explored additional ways to analyze algorithms, focusing on three major notations used to describe algorithm efficiency: Big O, Big Theta, and Big Omega. Understanding how each notation captures different bounds of performance helped clarify how algorithms behave in best‑case, worst‑case, and tight‑bound scenarios. We also discussed the analysis of recursive algorithms, which I’ll admit gave me some trouble. I kept mixing up the actual output of the code with the process of counting how many times a function is called. The back‑substitution method made sense at first, but the more I tried to apply it, the more confused I became. I definitely need to make time to visit office hours for more clarification. Sometimes the concepts click right away, and other times I find myself stuck in a loop of overthinking and not getting anywhere.