CST370 Week 3
July 11, 2025
This week we learned about brute force string matching, scanning every possible alignment to locate substrings in O(n·m) time. We also looked at exhaustive search techniques. We looked at Depth First Search (DFS). Next, we covered Breadth-First Search (BFS). I really enjoyed the graph problems because they were a bit challenging to understand at first, but once I got how they worked, it was fun to solve them Finally, we applied the divide-and-conquer paradigm, breaking problems into subproblems and recombining results, and analyzed their runtimes using the Master Theorem.
Comments
Post a Comment