Assume that a set X of n elements is represented as an array A of size at least n + 1. The elements of X are listed consecutively in A starting in the first position and terminating with 0. Assume further that no set contains 0.
Given the array representing X, write a program that lists all subsets of X.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.