Given 2 collections of elements, S1 and S2, what is the most efficient way to compute 3 sets (A, B, C), where A is the unique elements of S1 and B is unique elements of S2 and C is common items of S1 and S2.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given 2 collections of elements, S1 and S2, what is the most efficient way to compute 3 sets (A, B, C), where A is the unique elements of S1 and B is unique elements of S2 and C is common items of S1 and S2.
you can find out here: http://msdn.microsoft.com/en-us/library/bb546153.aspx