Week 7: Algorithms, Optimization, and Final Exam Prep
This week was an intense one! We covered a range of advanced algorithms, including non-comparison sorting techniques like Counting Sort and Radix Sort, as well as Dynamic Programming concepts such as the Coin-Collecting and Coin-Row problems. We also explored Warshall’s Algorithm for transitive closure, Floyd’s Algorithm for all-pairs shortest paths, and the greedy approach with Prim’s Algorithm for Minimum Spanning Trees. Dijkstra’s Algorithm was another key focus, reinforcing its importance in shortest path problems, which I had encountered in CST 311 studying network routing. This class has been a great learning experience, providing valuable insights into algorithmic problem-solving and optimization techniques. As we head into the final exam, I’m grateful for the knowledge gained and the problem-solving skills developed throughout the course.
