-
Notifications
You must be signed in to change notification settings - Fork 1
/
Intersection_Of_Sets.c
112 lines (108 loc) · 2.03 KB
/
Intersection_Of_Sets.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <stdio.h>
#include <stdlib.h>
int main()
{
system("cls");
int i, n1, n2, j = 0, k = 0, l = 0, f = 0;
printf("\n\t\tHow Many Elements Do You Want To Enter in SET 1: ");
scanf("%d", &n1);
int a[n1];
printf("\n");
for (i = 0; i < n1; i++)
{
printf("\t\tEnter %d Element: ", i + 1);
scanf("%d", &a[i]);
}
int d[n1];
for (i = 0; i < n1; i++)
{
d[i] = 1;
}
for (i = 0; i < n1; i++)
{
for (k = i + 1; k < n1; k++)
{
if (a[i] == a[k])
{
d[k] = 0;
}
}
if (d[i] != 0)
{
l++;
d[i] = a[i];
}
}
int y = 0;
for (i = 0; i < n1; i++)
{
if (d[i] != 0)
{
a[y] = d[i];
y++;
}
}
printf("\n\t\tHow Many Elements Do You Want To Enter in SET 2: ");
scanf("%d", &n2);
int b[n2];
printf("\n");
for (i = 0; i < n2; i++)
{
printf("\t\tEnter %d Element: ", i + 1);
scanf("%d", &b[i]);
}
int o[n2];
for (i = 0; i < n2; i++)
{
o[i] = 1;
}
for (i = 0; i < n2; i++)
{
for (k = i + 1; k < n1; k++)
{
if (b[i] == b[k])
{
o[k] = 0;
}
}
if (o[i] != 0)
{
f++;
o[i] = b[i];
}
}
int z = 0;
for (i = 0; i < n2; i++)
{
if (o[i] != 0)
{
b[z] = o[i];
z++;
}
}
int c[l + f], flag = 0, w = 0;
for (i = 0; i < l; i++)
{
flag = 0;
for (j = 0; j < f; j++)
{
if (a[i] == b[j])
{
flag = 1;
break;
}
}
if (flag == 1)
{
c[w] = a[i];
w++;
}
}
printf("\n\t\tIntersection of SET 1 and SET 2: ");
for (i = 0; i < w; i++)
{
printf("%d ", c[i]);
}
printf("\n\n\n\n\n");
return 0;
}