Question

一． 应用递归算法输出Fibonacci数列前n个数。。 F1=1 F2=1 Fn=Fn-1+Fn-2

Answer 1

#include <stdio.h>

int GetFibonacci(int n)
{
if (n == 1 || n == 2) return 1;
else return GetFibonacci(n-1)+GetFibonacci(n-2);
}

void main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
printf("%d ", GetFibonacci(i));
}

Answer 2

function Fibonacci(byval n as long) as long
if n=1 or n=2 then
Fibonacci=1
exit function
end if
Fibonacci=Fibonacci(n-1)+Fibonacci(n-2)
end function