斐波那契数列求解的四种方法

#include <iostream>

#include<vector>
#include <stack>
using namespace std;
int Fibonacci_01(int n)//递归（容易造成栈溢出）
{
if (n<3)
return 1;
return Fibonacci_01(n-1) + Fibonacci_01(n-2);


}
int Fibonacci_02(int n)//时间复杂度为o(n)
{
int *fib = new int[n];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < n; i++)
{
fib[i] = fib[i - 1] + fib[i - 2];
}
int tmp = fib[n-1];
return tmp;
}
int Fibonacci_03(int n)//时间复杂度为o(n)的同时节省了空间
{
int one, two;
one = 0; two = 1;
while (n>0)
{
one = one + two;
two = one - two;
n--;
}
return one;
}




struct My_arr
{
int a[2][2];
};
My_arr Matrix_mul(My_arr a, My_arr b, int m)//矩阵m行,m列矩阵乘法（方阵）
{
My_arr arr;
memset(arr.a, 0, sizeof(arr.a));//初始化


for (int i = 0; i < m; i++)//矩阵相乘
{
for (int j = 0; j < m; j++)
{
for (int k = 0; k < m; k++)
arr.a[i][j] += a.a[i][k] * b.a[k][j];
}
}
return arr;
}
int Fibonacci_04(int n)//矩阵快速幂求解， 时间复杂度为n^3*log(n)，节省了时间
{


My_arr arr_a;//建立单位阵
memset(arr_a.a, 0, sizeof(arr_a.a));
arr_a.a[0][0] = arr_a.a[0][1] = arr_a.a[1][0] = 1;
My_arr E_arr;//建立单位阵
memset(E_arr.a, 0, sizeof(E_arr.a));
E_arr.a[0][0] = E_arr.a[1][1] = 1;
while (n>0)
{
if (n & 1)//位运算
E_arr = Matrix_mul(arr_a, E_arr, 2);
arr_a = Matrix_mul(arr_a, arr_a, 2);


n = n >> 1;
}
return E_arr.a[0][1];
}
int main()
{


int n;
while (cin >> n){
cout << "结果:";
cout << Fibonacci_01(n) << ",";
cout << Fibonacci_02(n) << ",";
cout << Fibonacci_04(n) << ",";
cout << Fibonacci_03(n) << endl;
}

system("pause");
return 0;
}