using System;

using System.Collections.Generic;

​

public class Program

{

    public static IEnumerable<int> Intersection(IEnumerable<int> sortedA, IEnumerable<int> sortedB) 

    {

        // TODO:

        // Implement a function that return an intersection of the two sequences (sortedA, and sortedB)

        // Both of the input sequences are guaranteed to be sorted

        // Consider both computational and memory complexity. 

        // If you feel like it, it is ok to submit two versions and a short description of their advantages and drawbacks.

        return new [] { 1, 2, 3 };

    }

    public static void Main()

    {

        var result = Intersection(new [] { 3, 5, 7, 9}, new [] { 2, 5, 6, 9, 12});

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

        // Expected output: 5, 9

    }

}