DEVZEX
#include<stdio.h>
int union1(int setA[10],int setB[10],int
setC[10],int x,int y);
void accept(int x[10],int y);
void display(int x[10],int y);
int search(int A[10],int B[10],int sB);
int main()
{
int setA[10],setB[10],setC[10],sA,sB,ch,l;
printf("Enter the size of set A");
scanf("%d",&sA);
accept(setA,sA);
printf("Enter the size of set B");
scanf("%d",&sB);
accept(setA,sB);
do
{
printf("WHICH OPERATION YOU WANT TO PERFORM");
printf("1.UNION");
printf("2.INTSRSECTION");
printf("ENTER YOUR CHOICE");
scanf("%d",&ch);
switch(ch)
{
case 1:union1(setA,setB,setC,sA,sB);
break;
}
printf("do you want to continue");
scanf("%d",&l);
}while(l==1);
}
void accept(int x[10],int y)
{ int i;
printf("enter the elements of set ");
for(i=0;i<y;i++)
{ scanf("%d",&x[i]);
}
}
void display(int x[10],int y)
{ int i;
printf("elements of set are");
for(i=0;i<y;i++)
{ printf("%d",x[i]);
}
}
int union1(int setA[10],int setB[10],int setC[10],int x,int y)
{
int T,i,k,A,B;
T=search(A,B,y);
if(T==0)
{
setC[k]=setA[i];
k++;
}
else if(T==1)
{
setC[k]=setA[i];
k++;
setC[k]=setB[i];
}
}
int search(int A[10],int B[10],int sB)
{
int i,j;
for(i=0;i<sB;i++)
{
for(j=0;j<sB;j++)
{
if(A[i]==B[j])
{
return 0;
}
else
{
return 1;
}
}
}
}