contestada

The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() method, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.

Ex: If the input is: 7
the out put is :fibonacci(7) is 13

import java.util.Scanner;
public class LabProgram {
public static int fibonacci(int n) {
/* Type your code here. */
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
int startNum;
System.out.println("Enter your number: ");
startNum = scnr.nextInt();
System.out.println("fibonnaci(" + startNum + ") is " + fibonacci(startNum));
}
}

Respuesta :

r3t40

You could use recursion to write java method for computing fibonacci numbers. Though it will be inefficient for n > about 50, it will work.

public static int fibonacci(int n) {

if (n < 0) { return -1; }

if (n < 2) { return n; }

else { return fibonacci(n-1)+fibonacci(n-2); }

}

Hope this helps.

MrRoyal

The current term of a Fibonacci series is derived by adding the two previous terms of its sequence; and the first two terms are 0 and 1.

The code segment (without comments) that completes the program is as follows:

int T1 = 0, T2 = 1, cT;

   if (n < 0){

       return -1;     }

   for (int i = 2; i <= n; i++) {

       cT = T1 + T2;

       T1 = T2;

       T2 = cT;     }

   return T2;

With comments (to explain each line)

/*This declares the first term (T1), the second term (T2) and the current term (CT).

T1 and T2 are also initialized to 0 and 1, respectively

*/

int T1 = 0, T2 = 1, cT;

//This returns -1, if n is negative

   if (n < 0){         return -1;    

}

//The following iterates through n

   for (int i = 2; i <= n; i++) {

//This calculates cT

       cT = T1 + T2;

//This passes T2 to T1

       T1 = T2;

//This passes cT to T2

       T2 = cT;

   }

//This returns the required term of the Fibonacci series

   return T2;

At the end of the program, the nth term of the series would be returned to the main method for output.

Read more about Fibonacci series at:

https://brainly.com/question/24110383

Otras preguntas