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.

Comments

Popular posts from this blog