JAVA progs-2

The Fibonacci sequence is defined by the following rule. The first 2 values in the sequence are 1, 1. Every subsequent value is the sum of the 2 values preceding it. Write a Java program that uses both recursive and non-recursive functions to print the nth value of the Fibonacci sequence.

/*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);
}
}
Expected Input and output: 
Enter the value of t: 5 1 1 2 3 5
Actual Input & Output : 

For more info regarding technology and pro stuff...visit http://peoplezmind.com/