Sushil #include #include void FS(int a,int b,int n) { int c; c=a+b; a=b; b=c; int t=a+b; printf(“%d “,c); if(t>n) { exit(0); } if(c<n) { FS(a,b,n); } } int main() { int n; printf("Enter last number :\n"); scanf("%d",&n); int i,a=0,b=1; if(n==0) { printf("Fibonacci Series:0"); exit(0); } printf("\nFibonacci Series:\n%d %d ",a,b); FS(a,b,n); return 0; } 0 Log in to Reply
Ishita #Print Fibonacci Series using Recursion num=int(input()) def fib(num): if num<0: print('incorrect output') elif num==0: return 0 elif num==1: return 1 else: return fib(num-1)+fib(num-2) for i in range(num): print(fib(i)) i+=1 print("sum") print(fib(num)) 0 Log in to Reply
#include
#include
void FS(int a,int b,int n)
{
int c;
c=a+b;
a=b;
b=c;
int t=a+b;
printf(“%d “,c);
if(t>n)
{
exit(0);
}
if(c<n)
{
FS(a,b,n);
}
}
int main()
{
int n;
printf("Enter last number :\n");
scanf("%d",&n);
int i,a=0,b=1;
if(n==0)
{
printf("Fibonacci Series:0");
exit(0);
}
printf("\nFibonacci Series:\n%d %d ",a,b);
FS(a,b,n);
return 0;
}
#Print Fibonacci Series using Recursion
num=int(input())
def fib(num):
if num<0:
print('incorrect output')
elif num==0:
return 0
elif num==1:
return 1
else:
return fib(num-1)+fib(num-2)
for i in range(num):
print(fib(i))
i+=1
print("sum")
print(fib(num))
Thanks for contributing your code Ishita