Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

Is there an easy way to merge two ordered sequences using LINQ?

Tags:

c#

linq

Given

IEnumerable<T> first;
IEnumerable<T> second;

and that both first and second are ordered by a comparer Func<T, T, int> that returns 0 for equality, -1 when the first is "smaller" and 1 when the second is "smaller".

Is there a straight-forward way using LINQ to merge the two sequences in a way that makes the resulting sequence also ordered by the same comparer?

We're currently using a hand-crafted algorithm that works, but the readability of a straight-forward LINQ statement would be preferable.

like image 305
Johann Gerell Avatar asked Mar 21 '12 15:03

Johann Gerell


1 Answers

You could define an extension method for this. Something like

public static IEnumerable<T> MergeSorted<T>(this IEnumerable<T> first, IEnumerable<T> second, Func<T, T, int> comparer) 
{
    using (var firstEnumerator = first.GetEnumerator())
    using (var secondEnumerator = second.GetEnumerator())
    {

        var elementsLeftInFirst = firstEnumerator.MoveNext();
        var elementsLeftInSecond = secondEnumerator.MoveNext();
        while (elementsLeftInFirst || elementsLeftInSecond)
        {
            if (!elementsLeftInFirst)
            {
                    do
                    {
                        yield return secondEnumerator.Current;
                    } while (secondEnumerator.MoveNext());
                    yield break;
            }

            if (!elementsLeftInSecond)
            {
                    do
                    {
                        yield return firstEnumerator.Current;
                    } while (firstEnumerator.MoveNext());
                    yield break;
            }

            if (comparer(firstEnumerator.Current, secondEnumerator.Current) < 0)
            {
                yield return firstEnumerator.Current;
                elementsLeftInFirst = firstEnumerator.MoveNext();
            }
            else
            {
                yield return secondEnumerator.Current;
                elementsLeftInSecond = secondEnumerator.MoveNext();
            }
        }
    }
}

Usage:

var s1 = new[] { 1, 3, 5, 7, 9 };
var s2 = new[] { 2, 4, 6, 6, 6, 8 };

var merged = s1.MergeSorted(s2, (a, b) => a > b ? 1 : -1).ToList();

Console.WriteLine(string.Join(", ", merged));

Output:

1, 2, 3, 4, 5, 6, 6, 6, 7, 8, 9
like image 109
Brian Rasmussen Avatar answered Oct 20 '22 12:10

Brian Rasmussen