Week 4 - CST 370
This week we learned about merge sort and had our midterm. Merge sort is part of the divide-and-conquer algorithm in which a problem is divided into several subproblem, usually of equal size. Each subproblem is solved and then all are combined for the final solution. Concerning the midterm, I learned that I need to spend more time going over the materials and creating the cheat sheet. I feel like I panicked when I did the midterm and noticed that I did not put enough information on the cheat sheet to help me out.
Comments
Post a Comment