CST 370 Week 4
This week I focused on learning merge sort and its divide-and-conquer approach. I practiced breaking down arrays into subproblems, merging sorted halves, and analyzing its time efficiency. We also had a review session for the midterm, which helped clarify key topics from previous weeks such as asymptotic notation, brute force, and search algorithms. Preparing for the midterm encouraged me to revisit exercises and puzzles, reinforcing my understanding and giving me more confidence in applying these techniques.
Comments
Post a Comment