CST370: Design and Analysis of Algorithms, Week 4
Week 4 This week we focused on merge sort and we also had our midterm. Merge sort came back to me pretty quickly. I remembered how it works by splitting everything into smaller pieces and then merging them back together in order. Since I felt pretty confident with it, I was not too worried when it was added to the midterm material last minute. As for the midterm, I feel like I did fairly well, but we’ll see! I was definitely nervous going into it, but once I started working through the questions, I felt better about a lot of the material than I expected. The main area that still gets a little funky for me is recurrence relations and recursive algorithms. I usually understand them when the recurrence relation is plainly written out, but trying to decipher it from pseudocode is harder for me. I have to slow down and really think about what the basic operation is, how often it is being performed, and how that translates into the recurrence relation. Backward substitution and identify...
