CST-370 Week 3
This week, I've learned about several algorithm searches and their use cases. Some being BFS (Breadth-First Search), DFS (Depth-First Search), and the brute force string matching algorithm. BFS works by exploring the graph level by level. It starts at a designated node, visiting its neighbors first before moving onwards. A use case for this would be finding the shortest path with the fewest edges. BFS Example: A / | \ B C D / \ E F A → B → C → D → E → F I've watched previous recordings to help me get a better understanding of certain algorithms and the uncertainty I've had on some quiz problems.