Compare two string array without using linq [duplicate]

Question

Possible Duplicate:
Comparing Arrays in C#

I have a two string arrays:

string[] a;
string[] b;

How can I identify how many (and what) items of a are not present in b? As I am using .NET 2.0 so I can't use linq.

Do you want to know the count or the items that are not present?What have you tried so far? — Priyank Patel
– Priyank Patel, Commented Aug 23, 2012 at 15:59
@freebird I am reading one array in foreach and inside that foreach I am reading other array and then comparing each string one by one. — Zerotoinfinity
– Zerotoinfinity, Commented Aug 23, 2012 at 16:01
stackoverflow.com/questions/713341/comparing-arrays-in-c-sharp — reggie
– reggie, Commented Aug 23, 2012 at 16:05

Amiram Korach · Accepted Answer · 2012-08-23 16:07:16Z

2

List<string> result = new List<string>();
foreach (string sa in a)
{
   if (Array.IndexOf(b, sa) < 0)
      result.Add(sa);
}

int count = result.Count;

edited Aug 23, 2012 at 16:07

answered Aug 23, 2012 at 16:02

Amiram Korach

13.3k3 gold badges32 silver badges32 bronze badges

Sign up to request clarification or add additional context in comments.

3 Comments

Zerotoinfinity Over a year ago

'System.Array' does not contain a definition for 'Contains' and no extension method 'Contains' accepting a first argument of type 'System.Array' could be found (are you missing a using directive or an assembly reference?)

Zerotoinfinity Over a year ago

I believe that requires LINQ too

Amiram Korach Over a year ago

Edited my answer. It's really hard to remember what was in 2.0. I had to avoid "var" 3 times!

Nicolas Brown · Accepted Answer · 2012-08-23 16:05:01Z

1

convert them both to a List the do something like this:

List<string> difference = new List<string>();
foreach(string word in a)
{
    if(!b.Contains(word))
        difference.Add(word);
}

answered Aug 23, 2012 at 16:05

Nicolas Brown

1,5721 gold badge10 silver badges17 bronze badges

Comments

Community · Accepted Answer · 2017-05-23 12:04:46Z

1

I would recommand to transform your arrays of strings into HashSet<T>s.
See here for how to use a HashSet<T> in .NET 2.0

Then

How can I identify how many (and what) items of a are not present in b?

--> IntersectWith does precisely that.

edited May 23, 2017 at 12:04

CommunityBot

11 silver badge

answered Aug 23, 2012 at 16:08

Louis Kottmann

16.8k5 gold badges67 silver badges89 bronze badges

2 Comments

Joshua Honig Over a year ago

IntersectWith is only .Net 3.5+

Louis Kottmann Over a year ago

@jmh_gr .Net 3.5 and .Net 2.0 share the same DLR, see the first link for more information.

Dan · Accepted Answer · 2012-08-23 16:10:41Z

1

Try this:

string[] a = ...;
string[] b = ...;

List<string> bList = new List<string>(b);
List<string> valuesInAButNotInB = new List<string>();
foreach (string value in a)
{
    if (!bList.Contains(value))
        valuesInAButNotInB.Add(value);
}

answered Aug 23, 2012 at 16:10

Dan

9,8774 gold badges49 silver badges65 bronze badges

Comments

Servy · Accepted Answer · 2012-08-23 16:14:35Z

What you need to do is store the items from one list in a set, and then remove all of the items from that set if they are in the other collection. This will be much quicker for larger data sets than two nested loops, or performing lots of linear searches on one of the arrays.

Since HashSet doesn't exist in 2.0 I just use a Dictionary and ignore the values. It's a hack, but not a terrible one at that.

string[] a = null;
string[] b = null;
Dictionary<string, string> values = new Dictionary<string, string>();
foreach (string s in a)
{
    values.Add(s, s);
}

foreach (string s in b)
{
    values.Remove(s);
}

foreach (string s in values.Keys)
{
    Console.WriteLine(s);//This string is in 'a' and not in 'b'
}

ken2k · Accepted Answer · 2012-08-23 16:11:46Z

0

Just enumerate items in both a and b, just like in the old days:

private static void Main(string[] args)
{
    string[] a = new string[] { "a", "b", "c", "d" };
    string[] b = new string[] { "c", "d" };

    foreach (string tmp in a)
    {
        bool existsInB = false;
        foreach (string tmp2 in b)
        {
            if (tmp == tmp2)
            {
                existsInB = true;
                break;
            }
        }

        if (!existsInB)
        {
            Console.WriteLine(string.Format("{0} is not in b", tmp));
        }
    }

    Console.ReadLine();
}

edited Aug 23, 2012 at 16:11

answered Aug 23, 2012 at 16:04

ken2k

49.2k12 gold badges119 silver badges179 bronze badges

Comments

MethodMan · Accepted Answer · 2012-08-23 16:41:36Z

-1

private List<string> CompareArray(string[]  arr1, string[] arr2)
{
        List<string> compareList = new List<string>();
        //iterate throught it
        foreach( string str in arr1 )
        {
            if(!arr2.Contains( str ))
            {
                compareList.Add(str);
            }
        }
            return compareList;
 }

edited Aug 23, 2012 at 16:41

answered Aug 23, 2012 at 16:03

MethodMan

18.9k6 gold badges41 silver badges53 bronze badges

4 Comments

reggie Over a year ago

stackoverflow.com/questions/713341/comparing-arrays-in-c-sharp

Servy Over a year ago

This isn't what he wants. He wants the set difference, not sequence equality. The two are quite different.

Servy Over a year ago

@DJKRAZE You've changed it to now be set equality, rather than sequence equality (it doesn't require the same ordering) but it's still not a set difference. It needs to return the set of items in a that are not in b. That won't be a boolean value. The return type of your method alone tells you this isn't right.

MethodMan Over a year ago

I thought I edited the answer .. sorry about that I just updated I will review again as well

Collectives™ on Stack Overflow

Compare two string array without using linq [duplicate]

7 Answers 7

3 Comments

Comments

2 Comments

Comments

Comments

Comments

4 Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

7 Answers 7

3 Comments

Comments

2 Comments

Comments

Comments

Comments

4 Comments

Linked

Related