I think it is simply printing the subsets.Let Y1 be a subset,then Y-Y1 will be Y2,which will give u all the partitions...
On Fri, Sep 2, 2011 at 7:04 PM, kranthi raj <[email protected]> wrote: > I have a list / array Y (with n elements in it), and write an algorithm > which gives all valid bipartitions (Y1 ,Y2) of Y. > > -- > Sincerely, > Kranthi Raj A > 2nd Mtech > Dept Of Computer Science , > Indian Institute of Technology, Madras > #9884989577 > > -- > 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. > -- *Regards,* *Piyush Kapoor,* *2nd year,CSE IT-BHU* -- 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.
