The last week of our algorithms class is wrapping up. Everything went by faster than I anticipated, and I’m looking forward to taking a short break from working at my computer.
In our last week of class, we covered some fundamental algorithms for path finding and optimization. We looked at both the Floyd-Warshall algorithm, as well as Dijkstra’s algorithm to understand how to find the shortest path between points in two different graphical representations.
We also covered “dynamic programming”, which can be used to solve a multitude of problems. Although it is a slightly confusing concept, it can be used to help simplify problems that require recursion, which is a slightly confusing concept.
ChompingTheBit 