Week 2: My Week in Review

    This week we started with Asymptotic Notations, specifically Big-Oh (O), Big-Theta (Θ), and Big-Omega (Ω). Big-Oh is used to express the upper bound of an algorithm's time complexity, focusing on the dominant factor while ignoring coefficients and lower-order terms. Big-Theta, on the other hand, represents the exact time complexity when the algorithm's performance is the same in all cases (best, worst, and average), while Big-Omega denotes the lower bound of the algorithm's performance. We aslo  explored Theta Notation Recursive Algorithms in detail, with practical examples such as Recurrence Relations and Backward Substitution. We also covered Brute Force Algorithm Design, examining the use of brute force techniques in solving computational problems. The puzzles were tough but fun, and I had a great time with them.