#include <iostream>
using namespace std;
int fibnaci(int, int, int);
int fib(int n) {
return fibnaci(n, 1, 1);
}
int fibnaci(int n, int t0, int t1) {
if (n <= 0) return 0;
if (1 == n) return t0;
if (2 == n) return t1;
return fibnaci(n-1, t1, t0 + t1);
}
int main() {
cout << fib(10) << endl;
cout << fib(1) << endl;
cout << fib(5) << endl;
cout << fib(6) << endl;
return 0;
}
斐波那契数列的高效递归算法
最新推荐文章于 2024-07-12 18:02:43 发布