Given a vector, return all possible subsets of the vector in a cell array. Properties of basic set theory is assumed to be valid here e.g no repeated element, empty-set being a subset etc. Consider NaNs to be equal for this problem. Within a subset, sort all the elements. Any NaNs should appear at the beginning in the sorted subset.
Example:
Input : x=[1 2 3];
Output: y ={[],[1],[2],[3],[1 2],[1 3],[2 3],[1 2 3]};
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers26
Suggested Problems
-
13343 Solvers
-
Flip the main diagonal of a matrix
907 Solvers
-
Return elements unique to either input
808 Solvers
-
10833 Solvers
-
Determine Whether an array is empty
811 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
