Thread: Problem in generating Fibonacci sequence in java

hello all. i am working on the Fibonacci sequence constructor and i was wondering if i posted wha ti have so far if you could tell me if im on the right trac or not and maybe give me a few pointers to help me get it right heres what i have for code and the assignment so you can see what i have to do

public class FibonacciGenerator
{
    public static int fib(int n)
    {
                int fold1=0, fold2=1;
     public getNumber()
                for(int i=0; i<n; i++)
                {
                    int savefold1 = fold1;
                    fold1 = fold2;
                    fold2 = savefold1 + fold2;
                }
                return fold1;
    }
}

Write a program that prompts the user for n and prints the nth value in the Fibonacci sequence. Use a class FibonacciGenerator with a method nextNumber .

There is no need to store all values for fn. You only need the last two values to compute the next one in the series:
fold1 = 1;
fold2 = 1;
fnew = fold1 + fold2;
After that, discard fold2 , which is no longer needed, and set fold2 to fold1 and fold1 to fnew .

Here are three different solutions, it is clear to see which are best. Of course the final looped solution is the best for the problem big_c is facing.

import java.util.Scanner;
 
public class FibonacciGenerator
{
	public static void main(String[] args){
		while(true){
			System.out.println("Enter a number to compute the fibonacci number for:");
			int n = new Scanner(System.in).nextInt();
 
			System.out.println(fib(n));
			System.out.println(fibR(n));
			System.out.println(fibL(n));
 
		}
	}
 
	public static int fib(double n)
	{
		return (int)(( Math.pow(((1 + Math.sqrt(5)) / 2 ), n) / Math.sqrt(5) ) + 0.5);
	}
 
	public static int fibR(int n){
		if(n == 0) return 0;
		else if(n <= 2) return 1;
		return fibR(n-1)+fibR(n-2);
	}
 
	public static int fibL(int n){
		int A = 0;
		int B = 1;
		int current = 0;
		if(n == 0) return 0;
		else if(n <= 2) return 1;
		for(int i = 0; i < n-1; i++){
			current = A+B;
			A = B;
			B = current;
		}
		return current;
	}
}