CST370 Week 7
This week, I focused on non-comparison sorting methods like counting sort and radix sort, and I saw how they achieve linear time under certain conditions. I then explored dynamic programming through the coin-collecting and coin-row problems, which helped me understand how optimal substructure and overlapping subproblems work. Next, I learned about graph-algorithms for transitive closure and all-pairs shortest paths (, ), and finally the greedy paradigm through minimum spanning trees and . Working through the example exercises clarified how each technique fits different problem types.
Comments
Post a Comment