1. Mastering Bitwise Operators in C: A Comprehensive Guide with Examples - Codzify 2. Ternary Operators in C Programming: A Beginners Guide (2023) 3. Switch Statements in C 2023: Complete Guide for Beginners 4. Learn Functions in C Programming - A Complete Tutorial for Beginners in 2023 5. Call by Value and Call by Reference in C Programming - A Complete Tutorial for Beginners in 2023 6. Storage Classes in C Programming: A Comprehensive Guide for 2023 7. Arrays in C Programming: A Comprehensive Guide for 2023 8. Basics of 2D Array in C Programming in 2023: Definition, Initialization, and Accessing Elements 9. Beginners Guide to Strings in C Programming with Codes and Examples 10. Strings Functions in C Language - strlen, strcpy,strcmp,strcat functions 11. A Comprehensive Guide to Structures in C Programming in 2023 12. Learn Unions in C Programming with Codes, Examples, and Explanations in 2023 13. Dynamic Memory Allocation in C: Understanding malloc, calloc, realloc, and free Functions 14. Introduction to C Programming 15. Hello world program in C 16. String functions in C - strncat, strcpy, strncpy, strchr, strrchr, strstr functions 17. Program for Fibonacci number in C - Codzify.com 18. What is palindrome number in C? 19. Write a C program to find a factorial of a given number 20. Write a C program to check whether a given number is prime or not 21. Write a C program to check whether a given number is an Armstrong number or not. 22. Write a C Program to transpose a matrix 23. C Programming Tutorial: Understanding Comments and Identifiers with Code Examples 24. Master String Handling Functions in C in 2023 - Codzify Topics

Program for Fibonacci number in C - Codzify.com

Article by: Manish Methani

Last Updated: September 28, 2021 at 2:04pm IST
1 min 36 sec

Program for Fibonacci number in C
The Fibonacci numbers are the numbers in the following integer sequence.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

There are various methods to execute the Fibonacci number program using recursion, using dynamic programming, using space optimised method etc.

In this tutorial, we are going to cover two of the most common methods to run the Fibonacci series.

  1. Using Recursion
  2. Using Space optimized method
#include 
void fib(int n, int a, int b)
{ 
  int result;
  result = a + b; 
  printf(",%d", result);
 a = b;  
  b = result; 
  
if(n > 0)
{
 fib(n - 1, a, b); 
}
}

 int main() 
 {
      int a = 0, b = 1;
      printf("0,1");
     fib(8 , a,b);
      return 0;
}

Output

0,1,1,2,3,5,8,13,21,34,55

2) Using Space Optimised method

  
#include
int fib(int n)
{
  int a = 0, b = 1, c, i;
  if( n == 0)
  {
    return a;
 }
  for (i = 2; i <= n; i++)
  {
     c = a + b;
     a = b;
     b = c;
  printf("%d, ",a);
  }
  return b;
}
 
int main ()
{
  int n = 8;
    printf("0, ");
    fib(n);
  return 0;
}

Output

0, 1, 1, 2, 3, 5, 8, 13,

Learn to Build 5 Apps Without Coding using FlutterFlow

  • Lifetime access to all the 5 FlutterFlow Courses
  • Complete FlutterFlow training
  • All future course updates
  • Access via Codzify mobile app
  • 24h 42m of Learning Content
  • 5 FlutterFlow at Codzify just ₹1500 ($17.44)
  • Access to Dating App Course, Grocery App Course, Courses App Course, FlutterFlow AI Agents Course, Doctor Appointment Booking Supabase Course.
  • Clone Ready-Made Courses App instantly in FlutterFlow.
  • 30-Day 100% Money-Back Guarantee.

Learn More
Codzify Logo

Terms and Conditions    Cookie Policy   Refund Policy   Adsense Disclaimer

Contact: [email protected]