thats exactly what you are also trying to do.. see the example.. if there
are elements a,b,c then assume this is a set
A= {a,b,c}
now the power set is
{ {}, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}}
and these all sets are required as the output of this "permutation with a
twist" algo.
one simple solution to this problem is .. assume the no. of elements is n,
then first we assign index to each of these no.s
and then generate all no.s in [0, 2^n -1] and use the indices of the no.s to
get these subsets.
-Vijju
Visit me at http://vijju.net/
On 2/3/07, Gene <[EMAIL PROTECTED]> wrote:
>
>
> On Feb 3, 4:41 am, "Vijendra Singh" <[EMAIL PROTECTED]> wrote:
> > Isn't this a normal power set generation problem. What we are trying to
> do
> > here is, get all possible subsets. you can look for it on Google/Live
> >
> > -Vijju
>
> Sorry I can't find the discussion you're talking about. What you said
> above makes no sense to me. The power set _is_ the set of all
> possible subsets.
>
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
