Week 9

For some reason the contents this week seemed to make more sense to me than last.

At first I was a little bit confused on what and how to do these proofs and I was little confused with the idea of over and under-estimating certain terms when doing this. But all in all it's just really showing for what values of f(n) that is greater than (for big-O) or less than (for delta), therefore we can just overestimate/underestimate and omit certain values to make the equality still true. Proofs with complexity I find is not as bad as I've heard it to be. It seemed to have made more sense when not dealing with the amount of steps in a piece of code (for me at least).