C语言实现斐波那契数列

1.函数一用递归实现

2.函数二用循环实现

#include<stdio.h>
#include<stdlib.h>
#pragma warning(disable:4996)
//斐波那契 1,1,2,3,5,8,13...
int fibo1(int n)
{
    if (n ==  || n==)
    {
        return ;
    }
        return fibo1(n-)+fibo1(n - );

}
void fibo2(int n)
{
    if (n ==  || n == )
    {
        return ;
    }
    int f1 = ;
    int f2 = ;
    int fn = ;
    for (int i = ; i <= n-; i++)
    {
        fn = f1 + f2;
        f1 = f2;
        f2 = fn;
    }
    printf("%d\n", fn);
}
int main(){

    printf("%d\n", fibo1());
    fibo2();
    system("pause");
}