用递归求斐波那契数列的第n项/
#include <stdio.h>
/*用递归求斐波那契数列的第n项*/
int Array(int n);
int main(int argc, char * argv[])
{
int n;
printf("Enter n.\n");
scanf("%d", &n);
printf("The fiuges of n is %d.\n",Array(n));
return 0;
}
int Array(int n)
{
if (n == 2 || n == 1)
{
return 1;
}
return Array(n - 1)+ Array(n - 2);
}