Question

How to merge elements of two sorted not equal arrays by maintaining the sorted order in C#

Answer 1

using System;

public class Program
{
	public static void merge_sorted_not_equal_arrays(int[] array1, int[] array2) {
		int size1 = array1.Length;
		int size2 = array2.Length;

		for (int i = 0; i < size1; i++) { 
			if (array1[i] > array2[0]) {
				// swap 
				int tmp = array1[i];
				array1[i] = array2[0];
				array2[0] = tmp;

				int element0 = array2[0];

				// Move array2[0] to the correct position to maintain the sorted order
				int k;
				for (k = 1; k < size2 && array2[k] < element0; k++) {
					array2[k - 1] = array2[k];
				}

				array2[k - 1] = element0;
			}
		}
	}
	public static void Main(string[] args)
	{
		int[] array1 = new int[] {1, 4, 6, 8, 10};
		int[] array2 = new int[] {2, 3, 5, 9};

		merge_sorted_not_equal_arrays(array1, array2);

		Console.WriteLine(string.Join(" ", array1));
		Console.WriteLine(string.Join(" ", array2));
	}
}




/*
run:
 
1 2 3 4 5
6 8 9 10
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

using System;

public class Program
{
	public static void merge_sorted_not_equal_arrays(int[] array1, int[] array2) {
		int size1 = array1.Length;
		int size2 = array2.Length;

		 for (int i = size2 - 1; i >= 0; i--) {
            int j, last1 = array1[size1 - 1];
            for (j = size1 - 2; j >= 0 && array1[j] > array2[i]; j--) {
                array1[j + 1] = array1[j];
            }
            if (last1 > array2[i]) {
                array1[j + 1] = array2[i];
                array2[i] = last1;
            }
        }
	}
	public static void Main(string[] args)
	{
		int[] array1 = new int[] {1, 4, 6, 8, 10};
		int[] array2 = new int[] {2, 3, 5, 9};

		merge_sorted_not_equal_arrays(array1, array2);

		Console.WriteLine(string.Join(" ", array1));
		Console.WriteLine(string.Join(" ", array2));
	}
}




/*
run:
 
1 2 3 4 5
6 8 9 10
 
*/

 

70+ SQL courses for beginners and professionals