/* 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); } }
JAVA LEARNING:An art and entertainment for those who love it. For Online Assistance and help @email:Learnprogramm@gmail.com
Thursday, 28 April 2011
JAVA PROGRAM TO PRINT RECURSIVE SOLUTIONS
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment