Week 52 (1/28/2026 - 2/3/2026)
(Click on READ MORE for better formatting)
Hi everyone, welcome to my 52nd blog! This is the Week 4 post for CST 370 Design and Analysis of Algorithms.- Weekly learning journal relevant to this week's module. (50 words)
- Due to Week 4 being mainly dedicated to the course's midterm exam, there is minimal new content that is covered this week. The only new algorithm discussed was Merge Sort, a sorting algorithm with O(n log n) complexity by utilizing the divide and conquer technique. Other than Merge Sort, my focus on this week has been reviewing the content of weeks 1-3 and also creating a "cheat sheet" for the Midterm exam as an allowed resource.
- Since this was an exam week, there was no homework assignment or quiz.
- Finally, I also contributed this video to our course's official Discord server: https://youtube.com/shorts/51U9gYLJ5TE. It contains an excellent visual to help understand why Merge Sort is a O(n log n) algorithm.
That is all for this week, see you in my Week 53 post!
Comments
Post a Comment