This week I spent the majority of time studying for the midterm. My main concern was finding and analyzing the recursive relation of certain algorithms, but I managed to do any and all practice problems and something finally clicked for me regarding that topic and it makes much more sense than it did originally.
Week 4 introduced the merge sort algorithm. While it can seem complicated at first it really is just one use of the divide and conquer strategy, where we break down the problem into smaller parts and then solve the more manageable parts before merging the pieces back together.
No comments:
Post a Comment