CST370 Week 5

This week I dove into Quick Sort, learning how partitioning around a pivot can yield efficient sorting on average. I also studied binary tree traversals (inorder, preorder, postorder) and how to compute the tree’s height. The concept of decrease-and-conquer came next, applying it to binary search. We also learned about directed acyclic graphs (DAGs) and topological sorting, including Kahn’s algorithm. Finally, transform-and-conquer via pre-sorting taught me how sometimes sorting first can simplify later steps. These topics helped me see a broad set of algorithmic patterns and trade-offs.

Comments

Popular posts from this blog

CST Module 4 January 29th - February 4th

CST300 Module 1 January 8th - January 14th

CST Module 3 January 22nd - January 28th