斐波那契（Fibonacci）三种编程算法，数组法、循环法和递归法？
class Program
{static void Main(string[] args)
{
ArryFunc(10);
LoopFunc(10);
int a;
while (true)
{
a = Convert.ToInt32(Console.ReadLine());
Console.WriteLine(Fibonacci(a));
}
}
{
int[] arry=new int[n];
arry[0] = 0;
arry[1] = 1;
for (int i = 2; i < arry.Length; i++)
{
arry[i] = arry[i - 1] + arry[i-2];
Console.WriteLine(arry[i]);
}
}
public static void LoopFunc(int n)//循环法
{
int first = 0;
int second = 1;
int third = 1;
for (int i = 3; i <n; i++)
{
first = second;
second = third;
third = first + second;
Console.WriteLine(third);
}
}
public static int Fibonacci(int n)//递归法
{
if (n == 0) { return 0; };
if (n == 1) { return 1; };
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
}