/********************************************** The fibonocci numbers are defined by the following rule: f_0 = 1 f_1 = 1 f_n = f_(n-1) + f_(n-2) Write a program that computes fibonocci numbers. **********************************************/ #include <iostream> using namespace std; int fibonocci(int n); int main() { // Get integer n int n; cout << "Enter integer: "; cin >> n; // Print out number of characters in n cout << "Fibonocci " << n << " is "; cout << fibonocci(n) << endl; return 0; } int fibonocci(int n) { if (n == 0 || n == 1) return 1; else return fibonocci(n-1) + fibonocci(n-2); }