In the second week of my Design and Analysis of Algorithms course, we focused on analyzing the time efficiency of algorithms. We were introduced to three types of Asymptotic Notation: Big O, Big Theta, and Big Omega. Of these, Big O and Big Theta are the most commonly used. At first, I found these concepts a bit challenging to grasp, but after watching a few supplemental videos, I feel I now have a decent understanding.
We also covered recursive algorithms and how to analyze them. I’m not entirely confident yet when it comes to solving recursive problems, but I believe I’ll get there with more practice.
Aside from the main topics, the overall reading load this week was lighter, which I appreciated. However, I found the puzzles particularly difficult. I often have trouble wrapping my head around them, and I think I spent at least an hour on the puzzle in our quiz.
No comments:
Post a Comment