/* Write a C Program to Merging One Dimensional Array – Excluding The Repeating Element */
======================================================================
#include<stdio.h>
#include<conio.h>
void main()
{
int a[50],b[50],n1,n2,i,x;
clrscr();
printf(“enter the number of elements in the first array”);
scanf(“%d”,&n1);
printf(“enter the elements\n”);
48 C P
S
ROGRAMS WITH
OLUTIONS
for(i=0;i<n1;i++)
{
printf(“enter a[%d]”,i+1);
scanf(“%d”,&a[i]);
}
printf(“enter the number of elements in the second array”);
scanf(“%d”,&n2);
printf(“enter the elements\n”);
for(i=0;i<n2;i++)
{
printf(“enter b[%d]”,i+1);
scanf(“%d”,&b[i]);
}
for(x=0;x<n1;x++)
{
for(i=0;i<n2;i++)
{
if(b[i]==a[x])
{
b[i]=’ ‘;
}
}
}
for(i=o;i<n1;i++)
{
printf(“%d”,a[i]);
}
for(i=0;i<n2;i++)
{
if(b[i]==’ ‘;)
continue;
else
printf(“%d”,b[i]);
}
getch();
}
Output:
======
Enter the number of elements in the first array
3
Enter the elements
3
5
7
Enter the number of elements in the first array
3
Enter the elements
2
5
9
3 5 7 2 9
======================================================================
#include<stdio.h>
#include<conio.h>
void main()
{
int a[50],b[50],n1,n2,i,x;
clrscr();
printf(“enter the number of elements in the first array”);
scanf(“%d”,&n1);
printf(“enter the elements\n”);
48 C P
S
ROGRAMS WITH
OLUTIONS
for(i=0;i<n1;i++)
{
printf(“enter a[%d]”,i+1);
scanf(“%d”,&a[i]);
}
printf(“enter the number of elements in the second array”);
scanf(“%d”,&n2);
printf(“enter the elements\n”);
for(i=0;i<n2;i++)
{
printf(“enter b[%d]”,i+1);
scanf(“%d”,&b[i]);
}
for(x=0;x<n1;x++)
{
for(i=0;i<n2;i++)
{
if(b[i]==a[x])
{
b[i]=’ ‘;
}
}
}
for(i=o;i<n1;i++)
{
printf(“%d”,a[i]);
}
for(i=0;i<n2;i++)
{
if(b[i]==’ ‘;)
continue;
else
printf(“%d”,b[i]);
}
getch();
}
Output:
======
Enter the number of elements in the first array
3
Enter the elements
3
5
7
Enter the number of elements in the first array
3
Enter the elements
2
5
9
3 5 7 2 9
No comments:
Post a Comment