How to Merge Two Lists in C#

In intermediate-level interviews, candidates are frequently asked to ‘combine‘, ‘merge‘, ‘join‘, or ‘concatenate‘ two lists in C# programming. Alternatively, interviewers might rephrase the query to ‘merge two sorted lists in C#‘. Regardless of the exact wording, the expected response remains consistent. or if you have other interview questions follow us in Quora and ask any programing questions you want.

FREE : If you’re a new visitor preparing for an interview and need help or want to request a new question, you can use the form on the right side to ask your question. It’s free and doesn’t require signing in. Alternatively, you can ask in our Quora space, which is also free, and you’ll receive a response within 24 hours. Go ahead and check it out! do check How To Inverse A Matrix In C# and reverse a linked list recursively

Understand Question Merge Two Lists

As the title suggests, the interviewer will provide two lists or arrays to perform a join. Sometimes, they may ask to merge two sorted lists or arrays. In both cases, the logic remains the same, so don’t be discouraged.

Let’s comprehend the question through an example. Suppose we have two lists: the first named listA and the second named listB, containing values like this: listA = {1,2,3,4} and listB = {5,6,7,8,9,10}. Your output response would be outputList = {1,2,3,4,5,6,7,8,9,10}. I trust you grasp the objective of merging the two lists.

Do not be afraid of the question; we will cover both methods to concatenate two lists in C# without LINQ and with LINQ.

Understand Logic to Join Two Lists in C#

Let’s comprehend the logic behind joining two sorted lists or merging two lists in C#. In this program, we have two lists, A and B, both of which are already sorted. Let’s assume that A = {2, 4, 6} and B = {1, 3, 5, 7, 9, 10}. Now, you have two choices to merge those lists. First, combine the lists into a single list and then sort it. Second approach is to first sort the lists by each element and simultaneously add the sorted elements to the list.

In this post, I am going to follow the second approach. To begin, create a loop to fetch each element from both lists. During this process, compare the elements from each list to determine which one is smaller. By doing so, both lists will merge into a single list.

In some cases, both lists have different element counts, so you have to add the remaining elements from each list using a loop.

It’s quite confusing, isn’t it? Don’t worry. In the next section, I’ll implement this logic in code so you can understand the rest of the process there.

Check above c# merge two lists illustration gif to understand how c# combine two lists works.

Program to Merge Two Lists in C#

Let’s divide it into small steps to implement the logic clearly in the program. If you are a new visitor and not familiar with our work, I suggest checking out our Pattern, Pyramid, Number, and Array programs.

Step 1

The first step is simple: create the required variables according to the logic you have understood. In our case, I’m going to add an integer list named ‘outputList’ and two integer variables to use for retrieving elements from the list.

static List<int> MergeSortedLists(List<int> listA, List<int> listB)
{
    List<int> outputList = new List<int>();

    int i = 0, j = 0;

    return outputList;
}

Step 2

The second step is to create a loop to fetch an element from both lists, compare the elements using less than or equal to to determine the smaller element. Then, add that smaller element to the ‘outputList’ list and increment the respective integer variable (‘i’ and ‘j’ in our case). Additionally, add the end iteration logic, which checks that our integer variables must be smaller than the list count.

static List<int> MergeSortedLists(List<int> listA, List<int> listB)
{
    List<int> outputList = new List<int>();

    int i = 0, j = 0;

    while (i < listA.Count && j < listB.Count)
    {
        if (listA[i] < listB[j])
        {
            outputList.Add(listA[i]);
            i++;
        }
        else
        {
            outputList.Add(listB[j]);
            j++;
        }
    }

    return outputList;
}

Step 3

By following these steps, you’ll notice that joining two lists is 80% complete. This is because if both lists have the same number of elements, the last element from one list will be missing. Alternatively, if the lists have different numbers of elements, the elements from the list with the greater count will be missing. To solve this issue, we use another loop to add those missing elements.

static List<int> MergeSortedLists(List<int> listA, List<int> listB)
{
    List<int> outputList = new List<int>();

    int i = 0, j = 0;

    while (i < listA.Count && j < listB.Count)
    {
        if (listA[i] < listB[j])
        {
            outputList.Add(listA[i]);
            i++;
        }
        else
        {
            outputList.Add(listB[j]);
            j++;
        }
    }

    while (i < listA.Count)
    {
        outputList.Add(listA[i]);
        i++;
    }

    while (j < listB.Count)
    {
        outputList.Add(listB[j]);
        j++;
    }

    return outputList;
}

Step 4

The final step is to call this method and provide two sorted lists to obtain a single sorted list.

static void Main(string[] args)
{
    List<int> listA = new List<int> { 2, 4, 6 };
    List<int> listB = new List<int> { 1, 3, 5, 7, 9, 10 };

    List<int> mergedList = MergeSortedLists(listA, listB);

    foreach (var item in mergedList)
    {
        Console.Write(item + " ");
    }
}

Summarizing Merge Two Lists in C# Program

In summary, merging, joining, combining, or concatenating two lists in C# involves fetching elements from both lists, comparing them, and adding the smaller elements to a new list. This process ensures the creation of a single sorted list, thereby achieving the desired outcome efficiently.

By following these steps, you can effectively concatenate two lists in C#.