Question

This is my current solution. Any better search algorithms?

   public void membersOfBothGroup(string groupA,string groupB)
        {
            List usersInGroupA = getGroupMembers(groupA);
            List usersInGroupB = getGroupMembers(groupB);
            List userInBothAB = new List();
            foreach (string userA in usersInGroupA)
            { 
                foreach(string userB in usersInGroupB)
                {
                    if (userA == userB)
                    {
                        userInBothAB.Add(userA);
                    }
                }
            }
        }

Answer 1

Here’s an example (since the datatype is string):

List<string> groupA = new List<string>() { "Moe", "Larry", "Curly" };
List<string> groupB = new List<string>() { "Moe", "Shemp", "CurlyJoe" };

var result = groupB.Intersect(groupA);

Output:

Moe