CST370 - Class Engagement Week 5
CST370 - Class Engagement Week 5:
A variety of new algorithmic ideas were presented this week and they all stemmed from breaking problems down into subproblems. One topic that I particularly enjoyed was Quick Sort. I now better understand the partitioning strategy by selecting a pivot before the recursion begins. The various ways to traverse a tree (in-order, post-order, and pre-order) and when each traversal method might be applicable was enlightening. Topological sort using a DFS method and utilizing Kahn's algorithm for it was quite intriguing. Understanding the relationship between in-degree values made the algorithm much more intuitive. A fun example for us to practice making generalizations and deriving algorithms from examples was the King's Reach puzzle.
Comments
Post a Comment