Lecture 3 - Calculate Time Complexity

This is Lecture 3 of the series of lectures on algorithms. In this video, I have explained what different blocks an algorithm may have and we will see two examples of how to calculate the complexity of a simple for loop.
In this series, we will study topics like
1. Finding the Time complexity of an algorithm (loops, recursive) using the counting method, tree method, and recurrence relation.
2. Algorithms paradigms ( Divide and conquer, greedy, dynamic programming, backtracking, etc..)

Hope you will enjoy it!!!
Thanks