斐波那契数列的几种写法

#include<stdio.h>
int Fabio(int x)    //循环
{
	int i;
	int n1 = 1;
	int n2 = 1;
	int n3 = 1;
	for(i = 2;i<x;i++)
	{
		n3 = n1 + n2;
		n1 = n2;
		n2 = n3;
	}
	return n3;
}

int Fabio1(int n)    //递归
{
	if (n == 1 || n == 2)
	{
		return 1;
	}
	else
	{
		return Fabio1(n - 1) + Fabio1(n - 2);
	}
}

int main()
{
//循环数组写法
	/*int arr[] = { 1,1 };
	for (int i = 2; i < 20; i++)
	{
		arr[i] = arr[i - 2] + arr[i - 1];
	}
	for (int i = 0; i < 20; i++)
	{
		printf("%d ", arr[i]);
		}*/
	for (int i = 1; i<5; i++)
		{
			printf("%d  ", Fabio1(i));
		}


	getchar();
	getchar();
	return 0;

}