Recursion (Fibonacci Series)
Formula fib(n) = fib(n-1)+fib(n-2)
Initialize

Enter any number


Invalid Input


Num

Step Execution
#include <stdio.h>
int fib(int n);
void main() {
int num, array[20], ele;
scanf("%d",&num);
for( int i=0 ; i <= num ; i++ ) {
array[i-1]= fib(i);
printf("%d",array[i-1]);
}
}
int fib(n) {
if (n == 0)
return n;
else if (n == 1)
return 1;
else
return fib(n-2) + fib(n-1);
}
Code Output