Generation of SubsetsAdop t the following stra tegy to constr uct the list of all subsets of the set of the integers1, 2, . . . n . Use an STL vector to represent a single subset of integers, and use an STL listof vectors to represent a list of subsets. Start with a list Lo of one empty vector; then Lorepresents the list of all subsets of the empty set. Now suppose that you have created thelist Lk-l of all subsets of 1, 2, . .. , k-1. To form the list Lk of all subsets of 1, 2, . . . k,create an empty list L, and then for each vector v in Lk- t, add both v and v + [k] to L.Finally, set Lk to L. (Here by v + [k] we mean the result of adding the integer k to thevector v.) Test your program for all values of n ~ 4.
Generation of Subsets
Adop t the following stra tegy to constr uct the list of all subsets of the set of the integers
1, 2, . . . n . Use an STL vector to represent a single subset of integers, and use an STL list
of vectors to represent a list of subsets. Start with a list Lo of one empty vector; then Lo
represents the list of all subsets of the empty set. Now suppose that you have created the
list Lk-l of all subsets of 1, 2, . .. , k-1. To form the list Lk of all subsets of 1, 2, . . . k,
create an empty list L, and then for each vector v in Lk- t, add both v and v + [k] to L.
Finally, set Lk to L. (Here by v + [k] we mean the result of adding the integer k to the
vector v.) Test your program for all values of n ~ 4.
Step by step
Solved in 2 steps with 4 images