Java program to print Fibonacci sequence Recursive & Non Recursive

1 2 3 4 5 6 7 8 9 10 11 12 13 14

/*Non Recursive Solution*/ import java.util.Scanner; class Fib { public static void main(String args[ ]) { Scanner input=new Scanner(System.in); int i,a=1,b=1,c=0,t; System.out.println("Enter value of t:"); t=input.nextInt(); System.out.print(a); System.out.print(" "+b); for(i=0;i<t-2;i++) { c=a+b; a=b; b=c; System.out.print(" "+c); } System.out.println(); System.out.print(t+"th value of the series is: "+c); } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 /* Recursive Solution*/ import java.io.*; import java.lang.*; class Demo { int fib(int n) { if(n==1) return (1); else if(n==2) return (1); else return (fib(n-1)+fib(n-2)); } } class RecFibDemo { public static void main(String args[])throws IOException { InputStreamReader obj=new InputStreamReader(System.in); BufferedReader br=new BufferedReader(obj); System.out.println("enter last number"); int n=Integer.parseInt(br.readLine()); Demo ob=new Demo(); System.out.println("fibonacci series is as follows"); int res=0; for(int i=1;i<=n;i++) { res=ob.fib(i); System.out.println(" "+res); } System.out.println(); System.out.println(n+"th value of the series is "+res); }