0
import java.util.Scanner;

public class fibonacci{
    public static void main(String[] args){
        int n=0;
        int fib = n+1;
        Scanner X=new Scanner(System.in);
        System.out.print("Enter # of the term: ");
        n = X.nextInt();
            for (int i=3; i<=n; i++)
                {
                    i = i-1 + i-2;
                }
        System.out.print("Term is: "+n);
    }
}

I know the algorithm is wrong, but I just can't seem to figure it out correctly.
I'm trying to construct the fibonacci algorithm without recursion and arrays.
If anyone could give me suggestions or pointers, it would be much appreciated.

Edited by mike_2000_17: Fixed formatting

3
Contributors
4
Replies
5
Views
5 Years
Discussion Span
Last Post by NexG
0

The 33rd term is what i am looking for. With the correction done, it output's 3, which is incorrect ><

0

Try this:

import java.util.Scanner;


public class Fibonacci {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		System.out.println("Enter no. of term: ");
		int n = scanner.nextInt();
		int prevNo = 0;
		int no = 1;
		int fibo = 0;
		for(int i = 1; i<=n; i++){
			fibo = prevNo + no;
			prevNo = no;
			no = fibo;
		}
		System.out.println(n + "th term = " + fibo);
	}
}
This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.