Ok so if i have to match subsets of a set to a particular key how to do
that?
like if the set is { 2,3,4,5,6,7,10,12,13,14 }
{2,3,6,12} --- A
{2,3,4,12} --- B
{4,7,10,14} --- 2212
{5,13,14} --- 3434
How to implement such type of sets in C/C++ ??
On Sat, May 14, 2011 at 5:32 AM, Carlos Guia <[email protected]> wrote:
> If you mean how are they implemented, the standard doesn't not specify how
> it has to be done, just some complexity restrictions are imposed. However,
> most implementations use some kind of binary tree and specifically Microsoft
> Visual Studio's implementation uses red-black trees.
>
> Carlos Guía
>
>
> On Fri, May 13, 2011 at 2:40 PM, vivek dhiman <[email protected]>wrote:
>
>> i meant how sets behave ?
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "google-codejam" 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/google-code?hl=en.
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "google-codejam" 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/google-code?hl=en.
>
--
Regards
Vivek Dhiman
--
You received this message because you are subscribed to the Google Groups
"google-codejam" 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/google-code?hl=en.
