Why the time complexity is o(n) ? If we look carefully and calculate the complexity it should be O(2^n) because it’s value is increasing exponentially.
Time Complexity of recursion
@vanshikasharma1645, you are talking about factorial function right ??
so the time complexity is o(n) let me explain you with an example:-
take n=5
so we call factorial(5)
factorial(5)=5 * factorial(4)
= 5 * (4 * factorial(3) )
=5 * (4 * (3 * factorial(2))))
=5 * (4* (3 * (2 * 1) ) ) )
so you can see that we called factorial function 5 times and in each call we perfored 1 multiplication ,so for n you can see we would need n calls to function and the time complexity being o(n)