Chapter 17, Problem 12PC

Program Plan Intro

Recursive Generation of Subsets

Program Plan:

• Include the required header files
• Declare function prototypes.
• Define the “main ()” function.
  • Declare the required variables.
  • Get the input from the user.
    • If the user input is not in the range the condition exits the program.
  • Create the list and call the function “get_Subsets ()”.
  • Display the output.
• Define the overloaded stream insertion operator for vector of int.
  • Display the open square bracket.
  • If the number is in the range, display the number inside the bracket.
  • Display the close square bracket.
  • Return the output to the main function.
• Define the overloaded stream insertion operator for a list of generic type.
  • Display the open square bracket.
  • Create a list and declare the variable name “itr” for the list.
  • While condition used to check if the “itr” is not equal to last number in the same list.
    • If so, display the number.
    • Increment the “itr”.
    • Print the numbers separated by commas.
  • Display the close square bracket.
  • Return the output to the main function.
• Define the “get_subsets” vector function.
  • Declare the list of subsets.
  • Check the “n” value is equal to 0.
    • If do, start with a list of subsets of 1 to n that contains on the empty set.
    • Return the sub list.
  • Get the list of all subsets of 1 to n-1 and store it in a “sub_setList”.
  • Temporarily used to extend the subset list by declaring the vector variables.
  • While condition used to check if the “itr” is not equal to last number in the same list.
    • Declare the vector variables.
    • Push the value to the list.
    • Increment the “itr” value.
  • Return the value to the main function.