Generate Fibonacci Using Recursion
C++
Hard
4 views
Problem Description
Generate nth Fibonacci number recursively.
Real Life: Understanding recursive patterns in nature.
Step-by-Step Logic:
1. Base case: if n is 0 return 0, if n is 1 return 1
2. Recursive case: return fib(n-1) + fib(n-2)
3. Each call splits into two more calls
4. Forms a tree of recursive calls
Official Solution
int fibonacci(int n) {
if(n == 0) return 0;
if(n == 1) return 1;
return fibonacci(n - 1) + fibonacci(n - 2);
}
void function_q12_fibonacci_recursion() {
int term = 8;
cout << "Fibonacci series: ";
for(int i = 0; i < term; i++) {
cout << fibonacci(i) << " ";
}
cout << endl;
}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!