Fibonacci series using and without recursion

c code to print Fibonacci series without recursion

#include<stdio.h>

void Fibonacci(int);

int main()

{

    int k,n;

    long int i=0,j=1,f;

    printf("Enter the range of the Fibonacci series");

    scanf("%d %d ",&n);

    printf("Fibonacci Series:");

    printf("%d ",0);

    Fibonacci(n);

    return 0;

}

  void Fibonacci(int n)

{

    long int first=0,second=1,sum;

    while(n>0)

   {

         sum = first + second;

         first = second;

         second = sum;

         printf("%d ",sum);

         n--;

    }

}

c code to print Fibonacci series using recursion

#include<stdio.h>

void Fibonacci(int);

int main()

{

    int k,n;

    long int i=0,j=1,f;

    printf("Enter the range of the Fibonacci series");

    scanf("%d %d ",&n);

    printf("Fibonacci Series:");

    printf("%d ",0);

    Fibonacci(n);

    return 0;

}

  void Fibonacci(int n)

{

    long int first=0,second=1,sum;

if(n>0)

   {

         sum = first + second;

         first = second;

         second = sum;

         printf("%d ",sum);

         Fibonacci(n-1);

    }

}