CST 370 Weekly Journal #5

 Weekly Journal

This week in class I worked on implementing the Kahn algorithm for topological sorting. In addition, I learned how to correct in-degree calculations and queue processing. I reviewed tree traversal techniques, focusing on preorder, inorder, and postorder traversal and took the time to revisit quicksort to better understand partitioning with a pivot and how it applies to sorting efficiency.  Furthermore, I found that the introduction to "Decrease-and-Conquer" and "Transform-and-Conquer" techniques was very interesting because it provided deeper insights into the algorithmic problem-solving strategies. All in all, this week helped me strengthen my understanding of sorting, graph algorithms, and traversal methods. I had a nice little break after taking the midterm which was much needed rest and got more things done.