Lecture 2 - Asymptotic Notations

This is Lecture 2 of the series of lectures on algorithms. In this video, I have defined Asymptotic notations which are used to represent the complexity of an algorithm.
In this series, we will study topics like
1. Finding the Time complexity of an algorithm (loops, recursive) using counting method, tree method, and recurrence relation.
2. Algorithms paradigms ( Divide and conquer, greedy, dynamic programming, backtracking, etc..)

Hope you will enjoy it!!!
Thanks