Week 4: Merge Sort & Midterm Prep in CST 370

    This week was focused on preparing for the midterms. The combination of video lectures, reading, and the review session made it a time-intensive but insightful week. In CST370 we covered Merge Sort. In short, Merge Sort is a divide-and-conquer algorithm that splits an array into smaller subarrays, sorts them, and then merges them back together. It has a time complexity of O(n log n) in all cases, making it more efficient than algorithms like Bubble Sort. The recursion and merging process are crucial to understand, as they play a significant role in efficient sorting techniques. The midterm itself was challenging, but the review materials and the review session helped me feel more prepared.