求斐波那契数列

/**
求斐波那契数列
*/

#include<iostream>

long fibonacci1(int n);
long fibonacci2(int n);
using namespace std;

int main()
{
	int n1 = fibonacci1(6);
	int n2 = fibonacci2(3);
	cout << "case1:" << n1 << "      case2:" << n2;
	cin.get();
}

long fibonacci1(int n)
{
	if (n <=2 )
		return 1;
	return fibonacci1(n -1) + fibonacci1(n -2);
}

long fibonacci2(int n)
{
	long *fib = new long[n];
	fib[0] = fib[1] = 1;

	for (int i = 2; i < n; i++)
	{
		fib[i] = fib[i - 1] + fib[i -2];
	}
	return fib[n -1];
}