Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum( [2, 5, 10, 6], 12) true skipSum( [2, 5, 10, 6], 7) false skipSum( [2, 5, 10, 6], 16) false Given code: public static boolean skipSum(List list, int sum) { // call your recursive helper method return skipSumHelper (list, 0, sum); } 1. 2. 3. 4. For example: Test Result List list = Arrays.aslist(2, 5, 10, 6); true int sum = 12; System.out.println(skipSum(list, sum)); List list Arrays.asList(2, 5, 10, 6); false = int sum = 7; System.out.println(skipSum(list, sum)); List list = Arrays.aslist(2, 5, 10, 6); false int sum = 16; System.out.println(skipSum(1ist, sum));
Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum( [2, 5, 10, 6], 12) true skipSum( [2, 5, 10, 6], 7) false skipSum( [2, 5, 10, 6], 16) false Given code: public static boolean skipSum(List list, int sum) { // call your recursive helper method return skipSumHelper (list, 0, sum); } 1. 2. 3. 4. For example: Test Result List list = Arrays.aslist(2, 5, 10, 6); true int sum = 12; System.out.println(skipSum(list, sum)); List list Arrays.asList(2, 5, 10, 6); false = int sum = 7; System.out.println(skipSum(list, sum)); List list = Arrays.aslist(2, 5, 10, 6); false int sum = 16; System.out.println(skipSum(1ist, sum));
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
Related questions
Question
Complete this code
Do not use any loops or regular expressions.
THIS IS THE GIVEN CODE
public static boolean skipSum(List<Integer> list, int sum) {
// call your recursive helper method
returnskipSumHelper(list, 0, sum);
}
private static boolean skipSumHelper(List<Integer> list, int start, int sum) {
// base case
// recursive step
}
private static boolean skipSumHelper(List<Integer> list, int start, int sum) {
// base case
// recursive step
}
![Given a list of integers, we want to know whether it is possible to choose a
subset of some of the integers, such that the integers in the subset adds up to
the given sum recursively.
We also want that if an integer is chosen to be in the sum, the integer next to it in
the list must be skipped and not chosen to be in the sum.
Do not use any loops or regular expressions.
Test cases:
skipSum([2, 5, 10, 6], 12)
true
skipSum([2, 5, 10, 6], 7)
false
skipSum([2, 5, 10, 6], 16)
false
Given code:
public static boolean skipSum (List<Integer> list, int sum) {
// call your recursive helper method
return skipSumHelper (list, e, sum);
1.
2.
3.
4.
For example:
Test
Result
List<Integer> list
Arrays.asList(2, 5, 10, 6); true
int sum = 12;
System.out.println(skipSum(list, sum));
List<Integer> list = Arrays.aslist(2, 5, 10, 6); false
int sum = 7;
System.out.println(skipSum(list, sum));
List<Integer> list
Arrays.aslist(2, 5, 10, 6); false
int sum =
16;
System.out.println(skipSum(1list, sum));](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7933b4d7-dfbc-452b-bf78-981e959f7b6a%2F1821c446-c1eb-4c1b-9bd8-2945b0e2d8e7%2Fv5y7z9i_processed.png&w=3840&q=75)
Transcribed Image Text:Given a list of integers, we want to know whether it is possible to choose a
subset of some of the integers, such that the integers in the subset adds up to
the given sum recursively.
We also want that if an integer is chosen to be in the sum, the integer next to it in
the list must be skipped and not chosen to be in the sum.
Do not use any loops or regular expressions.
Test cases:
skipSum([2, 5, 10, 6], 12)
true
skipSum([2, 5, 10, 6], 7)
false
skipSum([2, 5, 10, 6], 16)
false
Given code:
public static boolean skipSum (List<Integer> list, int sum) {
// call your recursive helper method
return skipSumHelper (list, e, sum);
1.
2.
3.
4.
For example:
Test
Result
List<Integer> list
Arrays.asList(2, 5, 10, 6); true
int sum = 12;
System.out.println(skipSum(list, sum));
List<Integer> list = Arrays.aslist(2, 5, 10, 6); false
int sum = 7;
System.out.println(skipSum(list, sum));
List<Integer> list
Arrays.aslist(2, 5, 10, 6); false
int sum =
16;
System.out.println(skipSum(1list, sum));
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education