Fibonacci using Iterative & Recursive Function

 

#include <stdio.h>

int fib_iteration(int n);

int fib_recursive(int n);

int main ()
{
    int n;
    printf("Enter a Number : ");
    scanf("%d",&n);
    printf("The Fibonacci in iterative is : ");
    fib_iteration(n);
    printf("\n");
    printf("The Fibonacci in recursive is: %d",fib_recursive(n));
return 0;
}

int fib_iteration(int n)
{
    int a = 0;
    int b= 1;
    int result=0 ;
    for(int i=0;i<=n;i++)
    {
    printf("%d, ",a);
    b =a+b;
    a=b-a;
    
    }
return a ;
}

int fib_recursive(int n)
{
    if(n==0){ return 0;}
    if(n==1) { return 1;}
    int fibN = fib_recursive(n-1)+fib_recursive(n-2);
return fibN;
}