If the set has fewer elements than an integer has bits, just count
from 1 to MAXINT. If bit i is 0, the element is not in the set, and if
bit i is 1, the element is in the set.
Dave
On Aug 26, 2:20 pm, AKS <abhijeet.k.s...@gmail.com> wrote:
> Hello fellas,
>
> i am lookin for an algorithm to find all the possible subsets in a
> given set
>
> So, if the Set is say, A={a,b,c} omit the null set
>
> o/p: --- {a} {b} {c} {a,b} {b,c} {a,c} {a,b,c} omit the
> null set
>
> regards,
> Abhijeet
--~--~---------~--~----~------------~-------~--~----~
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
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
