This week was fun, we got to spend time learning about different kinds of algorithms, brute force string matching, and what exactly is a best case or worse case for a brute force approach. We looked at how to traverse a graph, using a depth first search algorithm, where (in putting it in my own terms) attempt to get the farthest down you possibility can in the graph until hitting a dead end, then when you do, back up til you reach a node that has a new node you haven't visited yet. We also discussed bread first search algorithm, which to me, is when you explore/discover all possible nodes connected to the current node you're on and note them in a queue. Then move on to the next node in the queue (in alphabetical or numerical order), and discover all possible new nodes there, adding them to the queue. Do this until ever node has been visited. We also covered the divide and conquer algorithm, which to me is a general technique that can be applied to multiple problem times, and programmatically it works well with recursive programming.
0 comments:
Post a Comment