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
-
7871 Solvers
-
Given a window, how many subsets of a vector sum positive
873 Solvers
-
Set the array elements whose value is 13 to 0
1445 Solvers
-
Do Fast Fourier Transformation
285 Solvers
-
Matrix multiplication across rows
399 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!
