斐波那契数列改良

int Fib(int first, int second, int n)
{
	if (n <= 2)
	{
		return n - 1;
	}
	else if (n == 3)
	{
		return first + second;
	}
	else
	{
		return Fib(second, first + second, n - 1);
	}
 
}

 long int feibonaqie_lowtotop(int n)
{
	int max = pow(2,(sizeof(int)*8)-1)-1;
 
	if(n<=0||n>max){
		return ERROR;
	}
	
	int i =0;
	long int arr[n];
	arr[1] = 1;
	arr[2] = 2;
	for(i=3; i<=n; i++){
		arr[i] = arr[i-1]+arr[i-2];
	}
	//printf("arr[%d] is %ld\n", i-1, arr[i-1]);
	return arr[i-1];
}