//MarkDown decription of task // # Merge Sorted Arrays // Sololearn [task](https://www.sololearn.com/learn/14382/?ref=app) // ## Description // Write a program that reads two sorted arrays from the user input, merges them into the third array and outputs the result. Arrays are sorted in ascending order. For example, the result of merging [1, 5, 8, 9] and [2, 3, 3, 14] is [1, 2, 3, 3, 5, 8, 9, 14]. // ## Examples // Input: // 1, 2, 3, 4 // 1, 1, 1, 42 // Output: // 1, 1, 1, 1, 2, 3, 4, 42 // Input: // 25, 55 // 1, 3, 94 // Output: // 1, 3, 25, 55, 94 // ## Bonus // Sort arrays before merging using System; using System.Collections; using System.Collections.Generic; using System.Text; namespace Merge_arrays { class Program { static void Main(string[] args) { int[] A = {3, 1, 7, 2}; int[] B = {5, 3, 10, 6}; Sort(A); Sort(B); System.Console.WriteLine(ArrayToString(MergeArrays(A, B))); // Console.WriteLine(ArrayToString(MergeArrays(A, B))); } static T[] MergeArrays(T[] a, T[] b) where T : IComparable { int i = 0; //Current element in a int j = 0; //Current element in b int k = 0; //Current element in merged array T[] merged = new T[a.Length + b.Length]; while (i < a.Length && j < b.Length) //Move elements until one array is done { if (a[i].CompareTo(b[j]) <= 0) merged[k++] = a[i++]; else merged[k++] = b[j++]; } while(i < a.Length) //If not done finish a merged[k++] = a[i++]; while(j < b.Length) //If not done finish b merged[k++] = b[j++]; return merged; } static string ArrayToString(IEnumerable array) { StringBuilder result = new StringBuilder("["); //[1, 2, 3] foreach(T value in array) { result.Append($"{value}, "); } result.Remove(result.Length-1, 1); result.Append("]"); return result.ToString(); } static void Sort(T[] array) where T : IComparable //Insertion sort { for(int i = 1; i < array.Length; i++) { T tmp = array[i]; //Store element to be inserted int j; for (j = i-1; j>=0 && tmp.CompareTo(array[j])<0; j--) //Shift elements { array[j+1] = array[j]; } array[j+1] = tmp; //Put element back } } } }

Merge Arrays