-
Notifications
You must be signed in to change notification settings - Fork 0
/
symmetric_diff.c
85 lines (83 loc) · 1.4 KB
/
symmetric_diff.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
// Symmetric Difference of two sets
#include <stdio.h>
int main()
{
int fl = 0;
int i, j, n, m, k;
printf("Enter the number of elements in first set:\n");
scanf("%d", &n);
int a[n];
printf("Enter the elements:\n");
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
printf("\nElement of First set:\n");
for (i = 0; i < n; i++)
{
printf("%d\t", a[i]);
}
printf("\nEnter the number of elements in second set:\n");
scanf("%d", &m);
int b[m],c[n+m];
printf("\nEnter the elements:\n");
for (i = 0; i < m; i++)
{
scanf("%d", &b[i]);
}
printf("\nElement of Second set:\n");
for (i = 0; i < m; i++)
{
printf("%d\t", b[i]);
}
k = 0;
for (i = 0; i < n; i++)
{
fl = 0;
for (j = 0; j < m; j++)
{
if (a[i] == b[j])
{
fl = 0;
break;
}
else
{
fl = 1;
}
}
if (fl == 1)
{
c[k] = a[i];
k++;
}
}
for (i = 0; i < m; i++)
{
fl = 0;
for (j = 0; j < n; j++)
{
if (b[i] == a[j])
{
fl = 0;
break;
}
else
fl = 1;
}
if (fl == 1)
{
c[k] = b[i];
k++;
}
}
printf("\nSymmetric Difference: ");
for (i = 0; i < k; i++)
{
if (c[i] != c[i + 1])
{
printf("%d\t,", c[i]);
}
}
return 0;
}