// MERGING OF TWO ARRAYS

#include<stdio.h>

void merge(int,int [10],int,int [10]);
void read(int [10],int);
int sort(int,int [10]);

int num1[10],num2[10],num3[10];

void main()
{

int i,j,n1,n2,temp;
clrscr();


					//READING ARRAYS
printf("Enter the no of elements of array 1\n");
scanf("%d",&n1);

		read(num1,n1);

printf("Enter the no of elements of array 2\n");
scanf("%d",&n2);
		read(num2,n2);
sort(n1,num1);
sort(n2,num2);
merge(n1,num1,n2,num2);

}


void merge(int n1,int num1[10],int n2,int num2[10])
	  {
	  int i=0,j=0,k=0,l=0;

					//MERGING
	  while((i<n1)&&(j<n2))
			 {
			 if(num1[i]<num2[j])
				{
				num3[k]=num1[i];
				i++;
				}
			 else
				{
				num3[k]=num2[j];
				j++;
				}
				k++;
			 }

	  while(i<n1)
			 {
			 num3[k]=num1[i];
			 i++;
			 k++;
			 }

	  while(j<n2)
			 {
			 num3[k]=num2[j];
			 j++;
			 k++;
			 }

	  l=k;

	  printf("\n  MERGED  ARRAY  IS  \n");

	  for(k=0;k<l;k++)
		  printf("%d\n",num3[k]);

	  printf("Press any key to exit..");
	  getch();
	  }

int sort(int n,int num[10])
	  {
	  int i,j,temp;
	  for(i=0;i<n;i++)
		  {
		  for(j=0;j<n-1;j++)
			  {
			  if(num[i]<num[j])
				 {
				 temp=num[i];
				 num[i]=num[j];
				 num[j]=temp;
				 }
			  }
		  }
	  }

void read(int num[10],int limit)
	  {
	  int i;
	  printf("Enter the elements\n");
		for(i=0;i<limit;i++)
			{
			printf("Enter element %d :",i+1);
			scanf("%d",&num[i]);
			}
	  }

/*SAMPLE OUTPUT
Enter the no of elements of array 1
4
Enter element 1 :1
Enter element 2 :6
Enter element 3 :2
Enter element 4 :0
Enter the no of elements of array 2
3
Enter the elements
Enter element 1 :3
Enter element 2 :2
Enter element 3 :1

  MERGED  ARRAY  IS
0
1
1
2
2
3
6
 */