斐波那契递归消除重复性

#include <iostream>
using namespace std;

void fibo_loop(int num);
int fibo_recurisv(int num);

int main()
{
cout<<fibo_recurisv(44);
//fibo(0,1,44);
return 0;
}

//递归方法且消除了重复性
static int temp = 1;
int fibo_recurisv(int num)
{
if (num == 1)
{
return 1;
}
else
{
int res = fibo_recurisv(--num);
int x = res+temp;
temp = res;
cout<<x<<" ";
return x;
}
}
//或者
void fibo(int a,int b,int num)
{
if (num >0)
{
--num;
cout<<b<<" ";
fibo(b, b+a,num);
}
}
//普通递归方法
int fibo_rec(int num)
{
if (num < 1)
{
return 1;
}
return fibo_rec(num-1)+fibo_rec(num-2);
}

//循环方法
void fibo_loop(int num)
{
int i=1;
int j=1;
int k=0;
cout<<i<<" "<<j<<" ";
for(int n=0; k<num; ++n)
{
k=i+j;
i=j;
j=k;
cout<<k<<" ";
}
}