Though the approach is correct, but I think it should say that Generate all bit strings of size n with k bits set. Where n is the number of elements in the set and k is the number of 1's in the string. On Sun, Aug 22, 2010 at 2:08 PM, R.ARAVINDH <[email protected]> wrote:
> @raj > > > really cool > > On Aug 22, 1:08 pm, Raj N <[email protected]> wrote: > > Generate all binary strings of length k. For eg: S={1,2,3,4,5} generate > all > > binary strings of length 5. 0 represents that particular number is absent > > and 1 for the presence of the number. > > > > > > > > On Fri, Aug 13, 2010 at 11:35 PM, asdf <[email protected]> wrote: > > > Most efficient algorithm to find all subsets of size K?? > > > > > -- > > > You received this message because you are subscribed to the Google > Groups > > > "Algorithm Geeks" group. > > > To post to this group, send email to [email protected]. > > > To unsubscribe from this group, send email to > > > [email protected]<algogeeks%[email protected]> > <algogeeks%2bunsubscr...@googlegroups .com> > > > . > > > For more options, visit this group at > > >http://groups.google.com/group/algogeeks?hl=en. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
