[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Finding all subsets
From: |
Soren Hauberg |
Subject: |
Finding all subsets |
Date: |
Tue, 5 Jul 2005 15:54:51 +0200 |
User-agent: |
Internet Messaging Program (IMP) H3 (4.0.3) |
Hi,
I can't seem to wrap my mind around a very simple problem.
I need to find all possible subsets of a set.
Example:
All possible subsets of
[1, 2, 3]
is
{ [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3] }
/Soren
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------
- Finding all subsets,
Soren Hauberg <=