Power Set Generation

Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

A power set of a set 'ARR' is the set of all possible subsets of 'ARR'.

Input:

N (an integer denoting the size of the array) ARR (N space-separated distinct integers)

Output:

For each 'N', print 2^N separate lines, each representing a subset. For each subset, output its elements separated by space.

Example:

Input:

ARR = [1, 2, 3]

Output:

[]
[1]
[2]
[1, 2]
[3]
[1, 3]
[2, 3]
[1, 2, 3]

Constraints:

1

Question

Power Set Generation

Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

A power set of a set 'ARR' is the set of all possible subsets of 'ARR'.

Input:

N (an integer denoting the size of the array)
ARR (N space-separated distinct integers)

Output:

For each 'N', print 2^N separate lines, each representing a subset.
For each subset, output its elements separated by space.

Example:

Input:

ARR = [1, 2, 3]

Output:

[]
[1]
[2]
[1, 2]
[3]
[1, 3]
[2, 3]
[1, 2, 3]

Constraints:

1 <= N <= 15
1 <= ARR[i] <= 50
Time limit: 1 second

Note:

You don’t need to print anything. Implement the function to return the appropriate power set where each subset's elements are sorted. Subset order in the power set is not significant, allowing multiple correct solutions.

Accepted Answer

Generate power set of sorted array of integers with individually sorted subsets.

Use recursion to generate all possible subsets by including or excluding each element.
Sort each subset before adding it to the power set.
Handle base case when all elements have been considered.
Time complexity can be exponential due to 2^N subsets being generated.