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 Solvers27
Suggested Problems
-
The Hitchhiker's Guide to MATLAB
3414 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2892 Solvers
-
Getting the row and column location from a matrix
301 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
400 Solvers
-
Create a matrix with difference of each row of input matrix
76 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!
