programming9
  • Flowcharts
  • Programs
      • Back
      • C Programs
      • C++ Programs
      • Java Programs
      • Python Codes
      • HTML Codes
      • Java Script Codes
      • SQL Codes
  • Tutorials
      • Back
      • Java Tutorials
      • Competitive Programming
      • Python Tutorials
      • C Programming
  • Blog
  • Login

C Program to Find Nth Fibonacci Number Using Recursion

Details
Written by: Rama Boya
Category: C Programs
#include<stdio.h>
int fib (int);
int main ()
{
  int n, result;
  printf ("Enter the Nth Number: ");
  scanf ("%d", &n);
  result = fib (n);
  printf ("The %dth number in Fibonacci series is %d\n", n, result);
  return 0;
}

/* function for  recursive fibonocci call */
int fib (int n)
{
  if (n == 0)
    {
      return 0;
    }
  else if (n == 1)
    {
      return 1;
    }
  else
    {
      return (fib (n - 1) + fib (n - 2));
    }
}

 

OUTPUT:

Enter the Nth Number: 8                                                                                                                 
The 8th number in Fibonacci series is 21   
Previous article: GCD of Two Numbers Without using LCM in C Prev Next article: C Program for Multiplication Table using Goto Statement Next
  • Swapping of Two Numbers Using Call By Reference in C
  • Implementation of Queue using Array in C
  • C Program to Implement STACK Operations Using Pointers
  • C Program for Addition of Two Numbers
  • C Program to Find Factorial of a Number using Functions
  • C Program for Circumference of a Circle
  • C Program to Implement SHELL SORT
  • C Program to Find Sum of 5 Subjects and Percentage
  • C Program to find Size of Integer
  • C Program to Convert Temperature from Degree Centigrade to Fahrenheit
  • C Program to Reverse Elements in Array
  • C Program to Implement Structure with Pointers
  • C Program to Compare Two Strings using strcmp()
  • C Program to Find Second Largest Number in an Array
  • C Program for Monthly Bill of a Newspaper
  • Privacy Policy
  • Cookie Policy
© programming9.com 2026
Back to top