Fibonacci with recursive

#include<stdio.h>
#include<conio.h>
void fibo(int,int,int);
void main()
{
    int l=1,p=1,n;
    clrscr();
    printf("Enter the last num");
    scanf("%d",&n);
    fibo(l,p,n);
    getch();

}
void fibo(int l,int p,int n)
{
    int c;
    c=l+p;
    printf(" %d",l);
    if(n>0)
        fibo(p,c,--n);
}

Find Fibonacci numbers

#include <stdio.h>



void main()

{

    int fib1 = 0, fib2 = 1, fib3, num, count = 0;



    printf("Enter the value of num \n");

    scanf("%d", &num);

    printf("First %d FIBONACCI numbers are ...\n", num);

    printf("%d\n", fib1);

    printf("%d\n", fib2);

    count = 2; /* fib1 and fib2 are already used */

    while (count < num)

    {

        fib3 = fib1 + fib2;

        count++;

        printf("%d\n", fib3);

        fib1 = fib2;

        fib2 = fib3;

   }

}