This week's lecture is really complicated at the beginning. We started to learn Big Oh and Big Theta. Larry introduced the formal definition of big oh and big theta. And then he showed us the method to proof these two. A little trick for us to find upper bound is to over-estimate, and under-estimate when we are asked to find the lower-bound.
Larry also taught us how to calculate the run time of a program for worst case. To be honest, I didn't get it. However, I think if I review lecture slices more and more times, i could finally get it :D.
No comments:
Post a Comment