This week I learned how brute-force algorithms can be used for problems like string matching and knapsack, where every possible option is explored to find the best result. I also got more comfortable with graph traversal using depth-first and breadth-first search paying attention to how the order of visiting nodes can affect the outcome. The materials helped me understand how to build search trees and mark visit sequences correctly. I also studied the Master Theorem, which makes it easier to analyze the efficiency of recursive algorithms. It was helpful to see how these different topics connect.
This week I focused a lot on understanding time complexity and recursive analysis. It was challenging at first to figure out how to break down recursive functions and write the correct recurrence relations. Applying the Master Theorem was especially tough because I had to carefully identify each part of the formula and decide which case applied. I also spent time reviewing the difference between Big O, Big Omega, and Big Theta, which helped me better understand how to describe the efficiency of an algorithm. These concepts took time to click but working through examples really helped.
Comments
Post a Comment