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]};
5700 Solvers
Count from 0 to N^M in base N.
200 Solvers
Return unique values without sorting
488 Solvers
141 Solvers
261 Solvers
Solution 858845
This is not a valid solution. It does not meet the requirement of elements in each subset being sorted. Try the input [1 3 2] and it does not give sorted subsets.