Lecture 1. Asymptotic Analysis and Solving Recurrences

Today, we talked about the definition of O(), Omega(), Theta(), omega(), o(). We also do a example of recurrence based on the merge sort algorithm.
If you are interested in what are general techniques of solving recurrence, here is a very good summary by Jeff Erickson.

Here is a link to the slides of lecture 1.

 Questions regarding lecture 1 can also be asked here.