using LINQ query two (or more) collections

Question

Hello friend How to change the following matching algorithm is LINQ? static void NotExist(int[] a int[] b) { bool YES; Console.WriteLine(The 'b' array element does not exist:); for (int i = 0; i YES = false; for (int j = 0; j if (a[i] == b[j]){ YES = true; break; } } if (!YES) Console.Write({0}a[i]); } Console.Write( ); } static void Main(string[] args){ int[] a = new int[5] { 1 22 39 6 10 }; int[] b = new int[5] { 2 4 39 10 89 }; NotExist(a b); Console.ReadKey(); } Thanks.

Jignesh Trivedi · Answer

hi try... var k1 = a.Except(b); foreach (var h in k1) { Console.WriteLine(h); } hope this will help you.

Joginder Banger · Answer

try this type may be help you. static void NotExist(int[] a int[] b) { var ii = from aa in a select new { aa = aa }; var bb = from cc in b select new { cc = cc }; foreach (var item in ii) { foreach (var my in bb) { if (item.aa.Equals(my.cc)) { Console.WriteLine(my.cc); } } } } static void Main(string[] args) { int[] a = new int[5] { 1 22 39 6 10 }; int[] b = new int[5] { 2 4 39 10 1 }; NotExist(a b); Console.ReadKey(); } for any query hit to reply