Could you change the summation() method so that it handles both positive and negative values?  If so, what would need to change in the code?

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
100%

Could you change the summation() method so that it handles both positive and negative values?  If so, what would need to change in the code?

28
29
30
31
32 }//end class|
else //if position is 2 or more
return fibonacciSequence(positionN-1)+fibonacciSequence(positionN-2);//add previous 2 position values
}//end method
Transcribed Image Text:28 29 30 31 32 }//end class| else //if position is 2 or more return fibonacciSequence(positionN-1)+fibonacciSequence(positionN-2);//add previous 2 position values }//end method
3 public class Recursive {
public static void main(String[] args) {
System.out.println("Summation of 5 = "+summation(5));
System.out.println("Summation of 1 = "+summation(1));
System.out.println("Summation of 10 = "+summation(10));
System.out.println("Summation of 1 = "+summation(1));
System.out.println("Summation of 7 = "+summation(7));
40
7
8
9
10
11
12
13
14
15
16
170
18
19
20
21
System.out.println("The first position value in Fibonacci Sequence is "+fibonacciSequence(1));
System.out.println("The third position value in Fibonacci Sequence is "+fibonacciSequence (3));
System.out.println("The seventh position value in Fibonacci Sequence is "+fibonacciSequence(7));
System.out.println("The twentith position value in Fibonacci Sequence is "+fibonacciSequence(20));
}
public static int summation(int n) {//function takes one number and return summation of 1 to n
if (n==1) {//if number n is 1, simply return 1
return 1;
}
else {//if n is more than 1
return (n + summation(n-1));//add number and call summation(n-1) which will find summation of next lower numbe
}//end else
}//end method
private static int fibonaccisequence(int positionN) {//method takes one position integer
if (positionN<=1) {//if position is 0, return 0, if it is 1, return 1
return positionN;
22
23
24
250
26
27
87
Transcribed Image Text:3 public class Recursive { public static void main(String[] args) { System.out.println("Summation of 5 = "+summation(5)); System.out.println("Summation of 1 = "+summation(1)); System.out.println("Summation of 10 = "+summation(10)); System.out.println("Summation of 1 = "+summation(1)); System.out.println("Summation of 7 = "+summation(7)); 40 7 8 9 10 11 12 13 14 15 16 170 18 19 20 21 System.out.println("The first position value in Fibonacci Sequence is "+fibonacciSequence(1)); System.out.println("The third position value in Fibonacci Sequence is "+fibonacciSequence (3)); System.out.println("The seventh position value in Fibonacci Sequence is "+fibonacciSequence(7)); System.out.println("The twentith position value in Fibonacci Sequence is "+fibonacciSequence(20)); } public static int summation(int n) {//function takes one number and return summation of 1 to n if (n==1) {//if number n is 1, simply return 1 return 1; } else {//if n is more than 1 return (n + summation(n-1));//add number and call summation(n-1) which will find summation of next lower numbe }//end else }//end method private static int fibonaccisequence(int positionN) {//method takes one position integer if (positionN<=1) {//if position is 0, return 0, if it is 1, return 1 return positionN; 22 23 24 250 26 27 87
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Math class and its different methods
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
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