search

Dain1234 / Design-and-analysis-algorithm

0 stars 0 forks source link

Fibonacci series using recursion #1

Open Dain1234 opened 2 years ago

Dain1234 commented 2 years ago

Screenshot (44)

Dain1234 commented 2 years ago

include

void printFibonacci(int n){ static int n1=0,n2=1,n3; if(n>0){ n3 = n1 + n2; n1 = n2; n2 = n3; printf("%d ",n3); printFibonacci(n-1); } } int main(){ int n; printf("Enter the number of elements: "); scanf("%d",&n); printf("Fibonacci Series: "); printf("%d %d ",0,1); printFibonacci(n-2);//n-2 because 2 numbers are already printed return 0; }