public class arraymerge {
	

public static void main(String[] args) {
		int [] Class1 = {10115, 21006, 47731, 11234, 22456, 81081, 55510, 33033, 76760, 19080};
		int [] Class2 = {88776, 53114, 11234, 21006, 22011, 31013, 76760, 20026, 19080, 81103};
		int[] ClassMerged = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
		int i = 0;
		int j = 0;
		int k = 0;
IntSelectionSorter(Class1);
IntSelectionSorter(Class2);

while ((i < (Class1.length)) && (j < Class2.length))
{	if (Class1[i] < Class2[j])
		{ClassMerged[k] = Class1[i];
		i++;
		k++;}
	else if
		(Class1[i] > Class2[j])
		{ClassMerged[k] = Class2[j];
		j++;
		k++;}
	else if (ClassMerged[k] == Class2[j])
		{ClassMerged[k] = Class2[j];
		k++; j++;
		}
}


for (i = 0; i < (Class1.length-1); i++)
	System.out.println(Class1[i]);

System.out.println("===========");

for (i = 0; i < (Class2.length-1); i++)
	System.out.println(Class2[i]);

System.out.println("===========");

for (i = 0; i < (ClassMerged.length-1); i++)
	System.out.println(ClassMerged[i]);

System.out.println("============");


}


public static void IntSelectionSorter(int[] array)
{
		int startScan;
		int index;
		int minIndex;
		int minValue;
		
		for (startScan = 0; startScan < (array.length-1); startScan++)
		{
			minIndex = startScan;
			minValue = array[startScan];
			for (index = startScan + 1; index < array.length; index++)
			{
				if (array[index] < minValue)
				{
					minValue = array[index];
					minIndex = index;
				}
			}
			array[minIndex] = array[startScan];
			array[startScan] = minValue;
		}
}

}