"My Computer Science Degree Journey" by Martin

 I always had trouble understanding what dynamic programming is. I used to think it was just a function or something similar, but I think I understand it better now. It’s more like a strategy to solve problems, and this approach is used in algorithms such as Bellman-Ford or Floyd-Warshall.

 This week was about AVL trees, 2-3 trees, hashing, heaps, and heapsort. Something new I learned was the 2-3 tree. I had already seen it in college, but I didn’t understand it back then. This week, I was finally able to understand how it works, and it seems much simpler than I thought before.

 This week was about Kahn’s algorithm, decrease and conquer, binary tree traversal and height, and the quicksort algorithm. I did some exercises on quicksort because I had trouble understanding the visualization of partitioning. I had practiced it before, but I think I had some problems. After this, I was able to understand it better, which helped me complete the homework.