import java.util.Scanner;
public class FiboRecursion {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count=sc.nextInt();
for(int i=0;i<=count-1;i++)
{
System.out.print(fibo(i)+” “);
}
}
public static int fibo(int num)
{
if(num==0)
{
return 0;
}
else if(num==1)
{
return 1;
}
return(fibo(num-1)+fibo(num-2));
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count=sc.nextInt();
for(int i=0;i<=count-1;i++)
{
System.out.print(fibo(i)+” “);
}
}
public static int fibo(int num)
{
if(num==0)
{
return 0;
}
else if(num==1)
{
return 1;
}
return(fibo(num-1)+fibo(num-2));
}
}
Output :-
Enter the length of fibonacci series :
9
0 1 1 2 3 5 8 13 21
9
0 1 1 2 3 5 8 13 21
No comments:
Post a Comment