cst 370: week 4

This week, I learned about merge sort, and also studied for the midterm. I learned that Merge sort uses divide and conquer technique to sort an input array with n elements A[0..n-1]

Additionally, merge sort has a time efficiency of O(n log n) in the best, average, and worst cases. It requires extra space for merging, making its space complexity O(n). It is often used for linked lists and external sorting where random access uses a lot of resources.

Going to the midterm review session was really helpful. I was able to go over the powerpoint with other team members, and clarify some doubts I had about theta and omega. What helped me the most was going through every single video and powerpoint, and writing out the notes in a document. From there, I made my notes sheet that I could reference during the test, and reviewed areas that I felt I wasn't as confident in.