How to Compare Two Lists in C# for Differences

Reading a file line by line is useful when handling large files without loading everything into memory at once.

✅ Best Practice: Use File.ReadLines() which is more memory efficient.

Example

foreach (string line in File.ReadLines("file.txt"))
{
    Console.WriteLine(line);
}

Why use ReadLines()?

Reads one line at a time, reducing overall memory usage. Ideal for large files (e.g., logs, CSVs).

Alternative: Use StreamReader (More Control)

For scenarios where you need custom processing while reading the contents of the file:

using (StreamReader reader = new StreamReader("file.txt"))
{
    string? line;
    while ((line = reader.ReadLine()) != null)
    {
        Console.WriteLine(line);
    }
}

Why use StreamReader?

Lets you handle exceptions, encoding, and buffering. Supports custom processing (e.g., search for a keyword while reading).

When to Use ReadAllLines()? If you need all lines at once, use:

string[] lines = File.ReadAllLines("file.txt");

Caution: Loads the entire file into memory—avoid for large files!

Using SqlDataReader asynchronously prevents blocking the main thread, improving performance in web apps and large queries. Here’s how to do it properly.

Use await with ExecuteReaderAsync()

using (SqlConnection conn = new SqlConnection(connectionString))
{
    await conn.OpenAsync();
    using (SqlCommand cmd = new SqlCommand("SELECT * FROM Users", conn))
    using (SqlDataReader reader = await cmd.ExecuteReaderAsync()) 
    {
        while (await reader.ReadAsync()) 
        {
            Console.WriteLine(reader["Username"]);
        }
    } // ✅ Auto-closes reader
} // ✅ Auto-closes connection

Why use async?

A couple of reasons:

• Frees up the thread while waiting for the database.
• Improves scalability in ASP.NET Core and web apps.

⚡ Alternative: ConfigureAwait(false) for ASP.NET

Use ConfigureAwait(false) in library code to avoid deadlocks in UI frameworks like ASP.NET.

using (SqlConnection conn = new SqlConnection(connectionString))
{
    await conn.OpenAsync().ConfigureAwait(false);
    using (SqlCommand cmd = new SqlCommand("SELECT * FROM Users", conn))
    using (SqlDataReader reader = await cmd.ExecuteReaderAsync().ConfigureAwait(false)) 
    {
        while (await reader.ReadAsync().ConfigureAwait(false)) 
        {
            Console.WriteLine(reader["Username"]);
        }
    }
}

When it comes to iterating over collections in C#, the performance difference between foreach and for loops primarily depends on the collection type being traversed.

For arrays and Lists, a traditional for loop with indexing can be marginally faster because it avoids the overhead of creating an enumerator object, especially in performance-critical scenarios.

The foreach loop internally creates an IEnumerator, which adds a small memory allocation and method call overhead.

However, for most modern applications, this performance difference is negligible and often optimized away by the JIT compiler.

The readability benefits of foreach typically outweigh the minor performance gains of for loops in non-critical code paths.

Collections like LinkedList or those implementing only IEnumerable actually perform better with foreach since they don't support efficient random access.

The rule of thumb: use foreach for readability in most cases, and only switch to for loops when benchmarking shows a meaningful performance improvement in your specific high-performance scenarios.

Example

// Collection to iterate
List<int> numbers = Enumerable.Range(1, 10000).ToList();

// Using for loop
public void ForLoopExample(List<int> items)
{
    int sum = 0;
    for (int i = 0; i < items.Count; i++)
    {
        sum += items[i];
    }
    // For loop can be slightly faster for List<T> and arrays
    // because it avoids creating an enumerator
}

// Using foreach loop 
public void ForEachLoopExample(List<int> items)
{
    int sum = 0;
    foreach (int item in items)
    {
        sum += item;
    }
    // More readable and works well for any collection type
    // Preferred for most scenarios where performance isn't critical
}

// For a LinkedList, foreach is typically faster
public void LinkedListExample(LinkedList<int> linkedItems)
{
    int sum = 0;
    // This would be inefficient with a for loop since LinkedList
    // doesn't support efficient indexing
    foreach (int item in linkedItems)
    {
        sum += item;
    }
}