Scribd
Upload
281 views2 pages

Recursion: Fibonacci Series Program in C Using Recursion

The document discusses Fibonacci series in C programming using both iterative and recursive methods. It provides code to generate Fibonacci numbers iteratively using a for loop, as well as recursively by calling a Fibonacci function. Recursion is less efficient due to function calls and potential for stack overflow with large numbers.

Uploaded by

Dana Mihaela
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
281 views2 pages

Recursion: Fibonacci Series Program in C Using Recursion

The document discusses Fibonacci series in C programming using both iterative and recursive methods. It provides code to generate Fibonacci numbers iteratively using a for loop, as well as recursively by calling a Fibonacci function. Recursion is less efficient due to function calls and potential for stack overflow with large numbers.

Uploaded by

Dana Mihaela
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Fibonacci series in c programming: c program for Fibonacci series without and with recursion.

Using the code below you can print as many numbers of terms of series as desired. Numbers of Fibonacci sequence are known as Fibonacci numbers. First few numbers of series are 0, 1, 1, 2, 3, 5, 8 etc, Except first two terms in sequence every other term is the sum of two previous terms, For example 8 = 3 + 5 (addition of 3, 5). This sequence has many applications in mathematics and Computer Science.
/* Fibonacci Series c language */ #include<stdio.h> int main() { int n, first = 0, second = 1, next, c; printf("Enter the number of terms\n"); scanf("%d",&n); printf("First %d terms of Fibonacci series are :-\n",n); for ( c = 0 ; c < n ; c++ ) { if ( c <= 1 ) next = c; else { next = first + second; first = second; second = next; } printf("%d\n",next); } return 0; }

Fibonacci series program in c using recursion


#include<stdio.h> int Fibonacci(int); main() { int n, i = 0, c; scanf("%d",&n); printf("Fibonacci series\n"); for ( c = 1 ; c <= n ; c++ )

{ printf("%d\n", Fibonacci(i)); i++; } return 0; } int Fibonacci(int n) { if ( n == 0 ) return 0; else if ( n == 1 ) return 1; else return ( Fibonacci(n-1) + Fibonacci(n-2) ); }

Recursion method is less efficient as it involves function calls which uses stack, also there are chances of stack overflow if function is called frequently for calculating larger Fibonacci numbers.

You might also like