CST 370-30 - Algorithm Design & Analysis Week 4
Week 4 This week we learned MergeSort and divide and conquer. We split the array into smaller parts until there is one element and then merge everything back in order. Once I followed the steps slowly it made sense. MergeSort always runs in Theta n log n which makes it efficient. While reviewing for the midterm I realized I messed up because I rushed. I missed questions about when Theta notation can be used, how to count comparisons in recursive functions, and how backward substitution works. Getting those wrong showed me I need more practice and I need to slow down during exams instead of guessing when I don't fully understand something.