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));
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 6PE
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
}
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
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning