16. 计算斐波那契数（递归方法）

 1 #include <iostream>
 2 using namespace std;
 3 
 4 long long fib_recursion (int n) {
 5     if (0 == n || 1 == n) {
 6         return 1;
 7     } else {
 8         return fib_recursion( n - 1 ) + fib_recursion( n - 2 );
 9     }
10 }
11 
12 int main() {
13     cout << "Enter n : ";
14     int n;
15     cin >> n;
16     long long result = fib_recursion(n);
17     cout << "result(recursion) : " << result << endl;
18 
19     return 0;
20 }