Merging1.java

/*
Copyright (C) Deepali Srivastava - All Rights Reserved
This code is part of DSA course available on CourseGalaxy.com    
*/

import java.util.Scanner;

public class Merging1
{
	private Merging1(){}	   //this class is not for instantiation
	
	/* a[low1]...a[up1] and a[low2]...a[up2] merged to temp[low1]...temp[up2] */
	public static void merge( int a[], int temp[], int low1, int up1, int low2, int up2 )
	{
		int i = low1;
		int j = low2;
		int k = low1;

		while( (i<=up1) && (j<=up2) )
		{
			if(a[i]<=a[j])
				temp[k++]=a[i++];
			else
				temp[k++]=a[j++];
		}

		while(i<=up1)
			temp[k++]=a[i++];
		
		while(j<=up2)
			temp[k++]=a[j++];
	}
	
	public static void main(String[] args)
	{
		int i;
		int[] a = {1,3,5,7,  2,4,6,9,11,14};
		int[] temp = new int[20];
		
		Scanner scan = new Scanner(System.in);	
		
		merge(a,temp,0,3,4,9);
		
		System.out.println("Array a is : ");
		for(i=0; i<=9; i++)
			System.out.print(a[i] + " ");
		System.out.println();
		
		System.out.println("Merged array temp is : ");
		for(i=0; i<=9; i++)
			System.out.print(temp[i] + " ");
		System.out.println();
		scan.close();
	}
}