/*

​

​

Input : a[] = {10, 5, 15}

        b[] = {20, 3, 2}

Output : Merge List :

        {2, 3, 5, 10, 15, 20}

​

​

*/

​

​

//method 1 -first Concatenate then Sort

​

using System; 

public class GFG { 

    // Function to merge array in sorted order 

    public static void sortedMerge(int []a, int []b,  

                                   int []res, int n,  

                                   int m) 

    { 

        // Concatenate two arrays 

        int i = 0, j = 0, k = 0; 

        while (i < n) { 

            res[k] = a[i]; 

            i++; 

            k++; 

        } 

        while (j < m) { 

            res[k] = b[j]; 

            j++; 

            k++; 

        } 

        // sorting the res array 

        Array.Sort(res); 

    } 

    /* Driver program to test above function */

    public static void Main()  

    { 

        int []a = {15,2, 23, 13}; 

        int []b = {7, 4, 9, 10}; 

        int n = a.Length; 

        int m = b.Length; 

        // Final merge list 

        int []res=new int[n + m]; 

        sortedMerge(a, b, res, n, m); 

        Console.Write("Sorted merged list :"); 

        for (int i = 0; i < n + m; i++) 

            Console.Write(" " + res[i]);  

    }

}

​

​

​