# Given a Set of Positive Integers, Find All Subsets in Python

## Find All Subsets in Python

Here, on this page, We will learn How to Find All Subsets in Python Programming Language. If a Set of Positive Integers are Given.

### Algorithm ( Method 1 )

• Create a recursive function with the following parameters, input array, current index, output array, or current subset;
• If all subsets must be stored, a vector of the array is required,
• If only the subsets must be printed, this space can be discarded.
• If the current index equals the array’s size, print the subset or output array, or insert the output array into the vector of arrays (or vectors),
• And then return.
• For very index, there are just two options.
• Ignore the current element and use the current subset and next index, I + 1, to call the recursive function.

### Python Code

Run
```def subsetsUtil(A, subset=[], index=0):

print(*subset)

for i in range(index, len(A)):
subset.append(A[i])

subsetsUtil(A, subset, i + 1)

subset.pop(-1)
return

array = [1, 2, 3]
subsetsUtil(array)
```

### Output

`11 21 2 31 322 33`

For similar Questions click on the given button