Fibonacci 費氏數列

Fabonacci_recursive
遞迴版

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

#include<iostream> #include<cstdlib> using namespace std; int fibon(int num); int main() { int n = 0; cout<<"請輸入想知道的費氏數列第 n 項:"; cin>>n; cout<<fibon(n); system("pause"); return 0; } int fibon(int num) { if (num==1 || num==0)return num; else return (fibon(num-1) + fibon(num-2)); }

Fabonacci
非遞迴版

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

#include<iostream> #include<cstdlib> using namespace std; int fibon(int num); int main() { int n = 0; cout<<"請輸入想知道的費氏數列第 n 項:"; cin>>n; cout<<fibon(n); system("pause"); return 0; } int fibon(int num) { int ans = 0; int n1 = 0,n2 = 1; if (num==0 || num==1)return num; else { for (int i=0;i<num-1;i++) { ans = n1 + n2; n1 = n2; n2 = ans; } return ans; } }