Question: Find the recurrence relation of the following recursive function. int Fibonacci(int n){ if ( n==1 or n==2) return 1; else return Fibonacci(n-1)+Fibonacci(n-2); }
Find the recurrence relation of the following recursive function.
int Fibonacci(int n){ if ( n==1 or n==2) return 1; else return Fibonacci(n-1)+Fibonacci(n-2); }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
