Journal 34
January 21 - January 27 This week's lecture and reading focused on merge sort, a divide-and-conquer algorithm. We focused on how arrays are recursively split, stored, and then merged to form a sorted array. This recurrence relation leads to a very efficient Θ (n log n) time complexity, which can be found by utilizing the Master Theorem. We also had a midterm examination this week, so much of my week was comprised of review, studying, and putting together a comprehensive 4-page cheat sheet. I shared this cheat sheet with my classmates on our Discord server in the hopes that it would help some of them on the exam, so I hope it fulfilled its purpose. I actually really enjoyed structuring my reviewing this way, as I felt my notes made a genuine contribution in helping others. I plan to make another cheat sheet of the same kind for the final exam. Overall, the exam was not too difficult, and I really think my studying paid off. I only got stuck on one question, and it was a puzz...