Question

Need help making this Java program:

package assignment1;

public class Fibonacci {

// Exercise 1: Fibonacci numbers

//

// fibonacci(n) returns nth Fibonacci number, and is defined by the

// recurrence relation F_n = F_n-1 + F_n-2, with seed values F_0=0 and F_1=1.

public long getFibonacci(long number) {

}

}

Answer 1

package assignment1;

public class Fibonacci {
    // Exercise 1: Fibonacci numbers
    //
    // fibonacci(n) returns nth Fibonacci number, and is defined by the
    // recurrence relation F_n = F_n-1 + F_n-2, with seed values F_0=0 and F_1=1.
    public long getFibonacci(long number) {
        if(number <= 1){
            return number;
        }
        else{
            long a = 0, b = 1, c = 1;
            while(number >= 2){
                c = a + b;
                a = b;
                b = c;
                number -= 1;
            }
            return c;
        }
    }
}