CST370 Week 7
This week I went over Counting Sort and Radix Sort, which skip the usual comparisons and can be really fast for certain kinds of numbers. I learned how dynamic programming can make some divide and conquer algorithms more efficient, like in the coin collection and coin row problems. We also covered Warshall’s and Floyd’s algorithms for finding transitive closures and all-pairs shortest paths, and how they connect to dynamic programming. On top of that, we looked at the greedy method with Prim’s algorithm for finding a minimum spanning tree. I kept up my habit of drawing everything out step by step, and seeing it on paper made each algorithm way easier to follow and understand.