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.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Needs helps to complete this activity

Image is attached

Thank you.

8.19 LAB: Fibonacci sequence (recursion)
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 output is:
fibonacci (7) is 13
Note: Use recursion and DO NOT use any loops.
318446.2220060.qx3zay7
LAB
8.19.1: LAB: Fibonacci sequence (recursion)
0/ 10
ACTIVITY
LabProgram.java
Load default template.
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;
startNum = scnr.nextInt () ;
System.out.println ("fibonacci (" + startNum + ") is
}
+ fibonacci (startNum));
Transcribed Image Text:8.19 LAB: Fibonacci sequence (recursion) 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 output is: fibonacci (7) is 13 Note: Use recursion and DO NOT use any loops. 318446.2220060.qx3zay7 LAB 8.19.1: LAB: Fibonacci sequence (recursion) 0/ 10 ACTIVITY LabProgram.java Load default template. 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; startNum = scnr.nextInt () ; System.out.println ("fibonacci (" + startNum + ") is } + fibonacci (startNum));
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education