@shasank:
how come the valid bipartition s are n/2..
those should be at least n right?
ex:
{1,2,3}
----{1},{2,3}
------{1,2},{3}
------{},{1,2,3}
If this is correct , then for printing sake it takes O(n^2) .
correct me if I'm wrong.........
On Fri, Sep 2, 2011 at 2:48 PM, WgpShashank <[email protected]>wrote:
> Piyush Has Correct Idea, If You Have N elements in Set/Array You Will Have
> Maximum 2^n Subsets (Power Set), Now Problem Reduced to generate the all
> such subsets , it will take O(2^n*n ) time , Now number of Valid
> Bipartitions are exactly n/2 .
>
> Note: Power Set includes 0 as well
>
> Correct me missed something or provicde any other better approach ?
>
>
> Shashank Mani
> Computer Science
> Birla Institute of Technology,Mesra
>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To view this discussion on the web visit
> https://groups.google.com/d/msg/algogeeks/-/UUb4EWQof1gJ.
>
> 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.
>
--
**Please do not print this e-mail until urgent requirement. Go Green!!
Save Papers <=> Save Trees
*BharatKumar Bagana*
**http://www.google.com/profiles/bagana.bharatkumar<http://www.google.com/profiles/bagana.bharatkumar>
*
Mobile +91 8056127652*
<[email protected]>
--
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.
