斐波那契数列的递归算法和迭代算法

1、递归算法ios #include<iostream> using namespace std; unsigned long Fibonacci(unsigned long); int main() { for ( int counter=0 ; counter < 20 ; counter++ )//这里只求一下20之内的斐波那契数列 cout << "Fibonacci(" << c

>>阅读原文<<