This week, we primarily focused on preparing for the midterm exam, but we were also introduced to a new sorting algorithm: Merge Sort. Merge Sort uses the divide-and-conquer technique by dividing the input into two halves, sorting them, and then merging them back together to form a sorted array.
As for the midterm itself, I wasn't too happy with my performance. I didn't sleep well leading up to the exam, so I felt a bit out of it. My biggest regret was not practicing more recursive algorithm problems beforehand. I had a general understanding, but I blanked during the exam and messed up the process. Besides the recursive questions, there were a few problems I didn't quite understand how to approach, and I accidentally misclicked the wrong answer on one question because I rushed a bit at the start.
Moving forward, I plan to review all the problems I got wrong during the exam and make sure I understand how to solve them, so I’m better prepared.
No comments:
Post a Comment