Week 5: QuickSort, Trees, and Topological Sorting.

    This week in CST 370 we dove into some core techniques, like QuickSort, binary tree traversals, and topological sorting. QuickSort really hammered home how crucial picking a good pivot is – it can make or break the whole thing. We also looked at different ways to traverse binary trees and how they're used for stuff like evaluating expressions or working with hierarchical data.

    Decrease-and-conquer came up too, and we talked about binary search and how effective it is for finding stuff in sorted arrays. Finally, we covered Kahn's Algorithm for topological sorting. That one's super useful for figuring out the order of things when you have dependencies, maybe like scheduling tasks or resolving software dependencies. Overall, it was a solid week for building up our algorithm design and problem-solving toolkit. Assignments and quiz were smooth this week! Looking forward for next week!