Tuesday, February 4, 2025

Design & Analysis ofAlgorithms - Week 4

The big thing this week ...Midterm time already.  Week 4 was thankfully a bit lighter on course work, which allowed more time to review for the midterm.  I reviewed the tests we have previously taken, and also went through the processors videos one more time, spending some time working through topics to try and reenforce them.  This was especially true around Big O notation and recursive backward substitution.  I think in the end it all paid off though.

This past week also brought the introduction of merge sort, taking a divide and conquer technique to accomplish its algorithmic task, in this case sorting elements.  Basically by breaking down a larger set of elements into smaller and smaller chunks until you can compare two.  Then the process of merging them back to gather, in order, into a the larger set again, now in order.

0 comments:

Post a Comment