Working on Problem Set 6 problem 4, it is required to generate all subsets of a list.
The easiest way is to recursive in my understanding. If I can generate all subsets of a list without the first element (that's list[1:]), and store it in a container, then iterate through the container A, and combine the first element, then store the combined result in container B. Container A and B all together should be the result.
I have great difficulty to implement this. I think I don't learn python well enough to write the code ... Anybody help me out!

See more answers at brainly.com

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.