Hi all,
A couple of days ago I needed a function to generate subset
combinations of a
given set and seeing as I couldn't find anything readily
available, I whipped
together this class. There's nothing much to it but I
thought maybe it could
be useful for others out there and save them a bit of time
so I'll open it up
for comments...
I wasn't sure about the name. I'm no mathematician but
wikipedia says that the
mathematical branch of Combinatorics deals with calculating
the size (count) of
combination and permutations subsets. So perhaps the
construction of these
subsets would be better suited to a different name?
Also if anyone wants to tear apart my algorithms, feel free,
especially since
they use recursion and I wondering how much more memory that
would use on large
sets.
--
David Sanders
--
PEAR Development Mailing List (http://pear.php.net/)
To unsubscribe, visit: http://www.php.net/unsub
.php
|