CST 370 - Week 4

 This week we primarily focused on the midterm that occurred this past Saturday. The midterm included topics from the past few weeks including Breadth First Search, Depth First Search, basic operations, time complexity, Master Theorem and inversions to name a few. Outside of the midterm, we studied the Merge Sort algorithm. Merge sort is essentially a divide and conquer algorithm that uses recursion to divide, sort and then merge. Although most of this week focused on review for the midterm, I found it extremely helpful in better understanding the material especially with the midterm review on Zoom.