How do you write a Fibonacci Series program?

Fibonacci series C program using recursion int f(int); int main() { int n, i = 0, c; scanf(“%d”, &n); printf(“Fibonacci series terms are: “); for (c = 1; c

Fibonacci series C program using recursion int f(int); int main() { int n, i = 0, c; scanf(“%d”, &n); printf(“Fibonacci series terms are: “); for (c = 1; c <= n; c++) { printf("%d ", f(i)); i++; } return 0; } int f(int n) { if (n == 0 || n == 1) return n; else. return (f(n-1) + f(n-2)); } Click to see full answer. People also ask, how do you write ac program for Fibonacci series? Fibonacci Series in C without recursion #include int main() { int n1=0,n2=1,n3,i,number; printf(“Enter the number of elements:”); scanf(“%d”,&number); printf(” %d %d”,n1,n2);//printing 0 and 1. for(i=2;i using namespace std; int main() { int n1=0,n2=1,n3,i,number; cout<<"Enter the number of elements: "; cin>>number; cout<

Similar Posts

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.