What is the better approach to find if a given set is a perfect subset of a set - If given subset is

Posted by Microkernel on Stack Overflow See other posts from Stack Overflow or by Microkernel
Published on 2010-05-24T18:32:39Z Indexed on 2010/05/24 18:51 UTC
Read the original article Hit count: 261

Filed under:
|
|

Hi guys,

What is the best approach to find if a given set(unsorted) is a perfect subset of a main set. I got to do some validation in my program where I got to compare the clients request set with the registered internal capability set.

I thought of doing by having internal capability set sorted(will not change once registered) and do Binary search for each element in the client's request set. Is it the best I could get? I suspected that there might be better approach.

Any idea?

Regards,

Microkernel

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about sets