Certainly! Here's an example:
#include <iostream>
int fibonacci(int n) {
// Base case: fibonacci of 0 or 1 is the number itself
if (n == 0 || n == 1) {
return n;
}
// Recursive case: fibonacci of n is the sum of fibonacci(n-1) and fibonacci(n-2)
return fibonacci(n - 1) + fibonacci(n - 2);
}
int main() {
int num = 6;
int result = fibonacci(num);
std::cout << "Fibonacci number at position " << num << " is " << result << std::endl;
return 0;
}
Output:
Fibonacci number at position 6 is 8
