//Given two arrays of integers, find all pairs or combinations of integers from each array that sum to zero. For each that is discovered, print the pair values to the console.

//E.g., if A = [0, -3, 6, 8, -1] and B = [1, 8, -3, 0, 15, -11, -6], the solution should correctly identify the pairs [(0,0), (6,-6), (-1,1)]

//The arrays are unbounded and can be any size 

//Elements in the arrays are not in any order (unsorted)

//Do not use LINQ

​

using System;

public class Program

{

    public static void Main()

    {

        int[] a = new int[] {0, -3, 6, 8, -1};

        int[] b = new int[] {1, 8, -3, 0, 15, -11, -6};

        FindPairs(a, b);

    }

    public static void FindPairs(int[] a, int[] b)

    {

        for (int i = 0; i < a.Length; i++)

        {

            for (int j = 0; j < b.Length; j++)

            {

                if (a[i] + b[j] == 0)

                {

                    Console.WriteLine("({0}, {1})", a[i], b[j]);

                }

            }

        }

    }

}