Week 5

This week covered a lot of material. One of the sorting algorithms we looked at was Quick Sort. Quick Sort works by choosing a “pivot” from the array and splitting the remaining elements around it. Another variation of Quick Sort uses the median-of-three method, which helps reduce the chance of running into the worst-case scenario and keeps performance more stable. Another data structure we studied was binary trees and how to traverse them. There are three main traversal methods: preorder, inorder, and postorder. Visually, the traversals make sense to me, and seeing the order in which nodes are visited helped me better understand how tree-based data is processed. Lastly, we were introduced to DAGs (Directed Acyclic Graphs) and topological sorting. Binary search is still one of my favorite ideas—cutting a problem in half over and over feels clean and efficient. DAGs were new to me, but I can already see how they relate to real-world problems like scheduling tasks and managing dependencies in systems.

Comments

Popular posts from this blog

Journal week 6

Journal Entry Week 2

CST334 Operating Systems Week 1