斐波那契數列的遞歸算法和迭代算法

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

>>阅读原文<<