cst 370: week 3

This week, we learned about brute force string matching, depth search algorithm, and breadth first algorithm, as well as divide and conquer algorithm design. Brute force string matching is a simple method where you check every possible position in the text to see if the pattern matches character by character. Depth first search is a way to explore a graph or tree by going as deep as possible along one path before backtracking. Breadth-first search instead explores a graph or tree level by level, visiting all the neighbors of a node before moving deeper. Finally, divide and conquer is a design strategy where you break a problem into smaller subproblems, solve them recursively, and then combine the results to form the overall solution.