CST 370 Week 3

This week, I explored several important algorithmic strategies. I began with brute force methods such as string matching and exhaustive search, applying them to problems like TSP and knapsack. Then I studied depth-first search (DFS) and breadth-first search (BFS), comparing their processes and analyzing their time efficiency. I also learned the divide and conquer approach, including the Master Theorem for analyzing recursive algorithms. The puzzles and exercises, especially Fake Coin and Finger Count, helped reinforce these concepts in a more engaging way.

Comments

Popular posts from this blog

CST363 Week 4 May 21st - May 27th

CST363 Week 3 May 14th - May 20th

CST489 Week 9