CST 370 - Week 5

This week we focused on a different topics, including quick sort, binary tree traversal, decrease and conquer, and transform and conquer. Part of our readings for this week included information on Kahn's algorithm for topological sorting, which is a method use to sort the order of vertices in a directed graph. One of the topics that I found interesting this week was "A King's Reach" puzzle, that outlined a chess situation in which a king piece could move horizontally, vertically, or diagonally adjacent. A similar question was later asked on the quiz for this week, however the king's moves had additional limitations. Overall, the resources and videos provided for this week did a great job of explaining the topics outlined.