What is time and space complexity

#1

What is time and space complexityWhat is time and space complexity of this code

#2

Hey @kishoretaru
We are making 3 calls from f(n)
so it will be of order O(3^n) [Similar to fibonacci recursion logic]

And space complexity will be O(n) used by recursion stack.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.