finding intersection and union

[timek1m]

my question is about finding union & intersection

if there is data which contains..

u
1 3
2 4

i
3 5
5 6

then program finds out u( union set), and print 1 2 3 4
i(intersection set)and print 5.

i have tried a lot of things and spent a lot of times, but i could not figure it out.
please answer this question if someone know it.
thanks

 

[CaKiwi]

Here's a modified version of the solution I provided for thread271-134331 by Yilei. He/she must be in the same class. If you want the output sorted, you can either insert each element into the h3 array in the correct order or sort the array before printing it.

/^[ui]/ {
union = 0
if ($0 == "u&quot union = 1
getline
n = split ($0,h1, " &quot
split ($0,h3, " &quot
getline
split ($0,h2, " &quot
j = 0
if (union) j = n
for (k2=1;k2<=n;k2++) {
for (k1=1;k1<=n;k1++) {
if (h1[k1] == h2[k2]) break
}
if (union) {
if (k1 > n) h3[++j] = h2[k2]
}
else {
if (k1 <= n) h3[++j] = h2[k2]
}
}
for (k1=1;k1<=j;k1++) printf(&quot;%d &quot;,h3[k1])
print &quot;&quot;
}

Hope we get an A

CaKiwi