Chapter 13, Problem 17PE

Program Plan Intro

Finding list of elements whose sum is “n”

Program plan:

Filename: “SubsetSumGenerator.java”

This program file is used to define a class “SubsetSumGenerator”. In the code,

• Define a class “SubsetSumGenerator”.
  • Define a method “main()”.
    • Define an array “primes”.
    • Define an array list “list”.
    • Define an array list “stack”.
    • Define a method “generateSubset()”.
      • If the “targetSum” is equal to “0”.
        • Call the method “printSum()” on “stack”.
      • If the “targetSum” is not equal to “0”,
        • Iterate a “while” loop to get the elements of “list”.
        • • Get the element from “list” and add to “stack”.
          • Call the method “generateSubset” recursively.
          • Remove the element from “stack”.
          • Increment the value of loop variable “from”.
    • Define a method “printSum()”.
      • Print the elements of “subset”.
      • Declare an integer variable “i”.
      • Print the first element of “subset”.
      • Add the first element to “sum”.
      • Iterate a “for” loop,
        • Get the elements of “subset” and print on the screen.
        • Add the elements.
      • Print the “sum”.