In week 3 I learned how brute force and exhaustive search reveal core algorithm behavior through string matching, knapsack, and traveling salesman problems. DFS and BFS showed how traversal order impacts performance in graphs. Divide and conquer and the Master Theorem helped analyze recursive algorithms and efficiency tradeoffs in practical problem solving contexts.