How Can I Efficiently Remove Duplicates from a C# Array?

Efficiently Removing Duplicates from C# Arrays

Data array processing often necessitates eliminating duplicate entries. C# offers several methods to achieve this; let's examine a common and efficient technique.

The Temporary Array Method

A straightforward approach involves a temporary array:

1. Iterate through the source array, comparing each element to those in the temporary array.
2. If an element exists in the temporary array, ignore it.
3. Otherwise, add it to the temporary array.

Illustrative Example:

<code class="language-csharp">int[] originalArray = { 1, 2, 3, 3, 4 };
int[] tempArray = new int[originalArray.Length];

int index = 0;
for (int i = 0; i < originalArray.Length; i++)
{
    bool isDuplicate = false;
    for (int j = 0; j < index; j++)
    {
        if (originalArray[i] == tempArray[j])
        {
            isDuplicate = true;
            break;
        }
    }
    if (!isDuplicate)
    {
        tempArray[index++] = originalArray[i];
    }
}

// tempArray now contains the unique elements</code>

While simple, this method's efficiency diminishes with larger arrays due to nested loops.

Alternative Solutions

Beyond the temporary array method, consider these alternatives:

• LINQ: Leverage LINQ's Distinct() method for a concise and declarative solution.
• HashSet: Utilize a HashSet, a data structure optimized for storing unique elements, for superior performance with large datasets.

The optimal approach depends on your application's specific needs and limitations.

The above is the detailed content of How Can I Efficiently Remove Duplicates from a C# Array?. For more information, please follow other related articles on the PHP Chinese website!