Find Distinct Elements in a Set in C#

The following program demonstrates how to Find Distinct Elements in a Set in C#.

In order to find the distinct elements in an array, we use the Distinct() method of LINQ (Language Integrated Query). Basically, the Distinct() method works on a data source. So, we take the array containing duplicate elements as the data source. Further, the method returns the distinct elements from the data source.

using System;
using System.Linq;
namespace DistinctMethodDemo
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] arr = {1,2,2,1,1,1,1,3,4,1,2,3,3,4,7,5,6,6,5,8,9,12,14,15,1,2,8,5,70,5,5,6,16 };
            Console.WriteLine("All Elements in the Set...");
            foreach (int i in arr)
                Console.Write(i + " ");
            Console.WriteLine();

            Console.WriteLine("Distinct Elements in the Set...");
            var q = arr.Distinct();
            foreach (int i in q)
                Console.Write(i + " ");
            Console.WriteLine();
        }
    }
}

Output

**A Program to Find Distinct Elements in a Set in C#**

Further Reading