Last week, we learned what recursion is and how it works.

In this lecture, we will cover a little theoretical topics of some terminology definition, 

and how to analyze an algorithm by using asymptotic analysis.

This lecture will be much more difficult than the last lecture, so... please be prepared.