Time Complexity Analysis

There are two types of Algos:

Iterative and Recursive.

They both can be converted into each other.

Analyzing these programs, for iterative, count the number of times the loop is executed.

Power wise they both are same but analysis wise its different.

If there is no iteration or recursion in the algo, then it means that theres no dependency of the running time on the inout size. Whatever is the input size, the running time will be a constant value.