Problem 2417. all possible subsets of set
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 commentsProblem Recent Solvers24
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5694 Solvers
-
308 Solvers
-
Return unique values without sorting
935 Solvers
-
951 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
398 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!