CST370 - week 3

 This week, we learned more about the brute force method. We analyzed time complexity of string matching using brute force. If we were to use a brute force method for combinational problems, we would use what's called an exhaustive search. This is where you analyze every possible solution and then find the best one. 

We also learned two different search methods for data structures; the first being Depth-First Search (DFS).

DFS starts at the root node and goes as far as possible along each branch until it reaches the end and then backtracks to the next. I used this approach on this week's homework assignment.

The next method is Breadth-First Search:

BFS explores all nodes at the current depth level, before continuing onto the next.

Unfortunately, I did not get a chance to go to office hours this week, but considering my score on Quiz 2, there are definitely concepts in that week that need more clarification for me.