Write a Java program that uses both recursive and non-recursive functions to print nth value in the Fibonacci sequence
Without recursion:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | import java.util.Scanner; class fibonacci { public static void main(String[] input) { int x,y; x=Integer.parseInt(input[0]); y=Integer.parseInt(input[1]); Scanner s=new Scanner(System.in); System.out.println(“Enter the value of n:”); int n=s.nextInt(); int z[]=new int[n]; z[0]=x; z[1]=y; for(int i=2;i<n;i++) { z[i]=z[i-1]+z[i-2]; } for(int i=0;i<n;i++) { System.out.println(z[i]); } } } |
With recursion:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | import java.util.Scanner; class fibonacci { public static void main(String[] args) { Scanner s=new Scanner(System.in); System.out.println(“Enter the value of n:”); int n=s.nextInt(); fiboni f1=new fiboni(); System.out.println(f1.fibon(n)); } } class fiboni { public int fibon(int a) { if(a==0 || a==1) return 1; else return fibon(a-1)+fibon(a-2); } } |
Output:
10
1
1
2
3
5
8
13
21
34
55
Description :
This is the one stop educational site for all Electronic and Computer students. If you want to learn something new then we are here to help. We work on Microcontroller projects, Basic Electronics, Digital electronics, Computer projects and also in basic c/c++ programs.
#Home #Sitemap #Submit #Terms of Use
Copyright©2011 electrofriends.com All Rights Reserved
Contact:info@electrofriends.com | Powered by Dhyeya
March 28th, 2011 at 7:29 pm
wow…. i dnt knw wat to say….!!! but u didnt hav any comment abut ur program dat’s y i am publishin a comment…
….i really cant understand ur programs coz u hav sum kind of thing wich is not in my syllabus…..
anyway i appreciate u 4 takin effort to publish …