Week 8: More Algorithms, Big O, Midterm, and Assignment

    This week started off with finishing off going over limiting behavior and big O. This was mostly review but with some more formal definition and proofs. I understood this part fairly well so I wont really go over it too much. In the future I'll practice some more of it and also read over functions in order of growth that aren't too obvious to me.
   As for the rest of this week, it was a bit tougher. Frankly, I can't say much about insertion sort and max slice algorithms because I really do need to read up on them and review them, which I haven't done yet because I've had to keep up with the onslaught of midterms and assignments during the past two weeks.
  That being said, I've been focusing my energy on the stuff for the midterm and getting the assignment right. It's going pretty well so far. These proofs are much easier for me to work with than understanding how algorithms are working, so hopefully I'll do well on the midterm and the assignment. I won't publish my solutions to the assignment now since it still hasn't past the due-date. Next week I'll update my blog on how the midterm and assignment went, and perhaps some more on this weeks and next weeks material if I get the chance to go over it and understand it better (which hopefully I will).