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]};
1116 Solvers
Omit columns averages from a matrix
469 Solvers
460 Solvers
Rotate and display numbered tile
216 Solvers
Sum the numbers on the main diagonal
351 Solvers
Tags