CST 370 - Week 2

 This week, something interesting I learned about is the analysis of recursive and non-recursive algorithms. In this week’s homework, I used non-recursive algorithms to solve my problems. My algorithms in both cases focused on sorting, then checking: in one case, finding the minimum distance, and in another, shortening the consecutive range.

Comments

Post a Comment

Popular posts from this blog

CST 370 - Week 6

 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.
Read more

CST 370 - Week 5

 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.
Read more

CST 370 - Week 4

 This week’s topic was Merge Sort and the Divide and Conquer algorithm. It was also the week of the midterm. I felt confident when I studied, but unfortunately, I didn’t get the grade I wanted. There were some questions I felt bad about failing. The first one was detecting the binary search tree, and the last one was about finding the fake coin among 20 coins and determining if it was heavier or lighter. I answered that it would take three weighings, but the correct answer was two because the question asked for the minimum number of weighings, not the guaranteed result.
Read more