Codes/union_intersection_sorted array.cpp at main · yourboymim/Codes · GitHub

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
#include<bits/stdc++.h>
using namespace std;

int main(){

    int n,m;
    cin >> n >> m;
    int arr1[n],arr2[m];
    for(int i=0;i<n;i++)
        cin >> arr1[i];
    for(int i=0;i<m;i++)
        cin >> arr2[i];
    int i = 0;
    int j = 0;
    int flag = -1; // Used to ignore the duplicates in an array
    // Finding union
    cout << "Union of the two arrays: ";
    while(i < n && j < m)
    {
        if(arr1[i] == arr2[j])
        {
            if(arr1[i] != flag)
            {
                flag = arr1[i];
                cout << arr1[i++] << " ";
                j++;
            }
            else
            {
                i++; j++;
            }
        }
        else if(arr1[i] < arr2[j])
        {
            if(arr1[i] != flag)
            {
                flag = arr1[i];
                cout << arr1[i++] << " ";
            }
            else
                i++;
        }
        else
        {
            if(arr2[j] != flag)
            {
                flag = arr2[j];
                cout << arr2[j++] << " ";
            }
            else
                j++;
        }
    }
    while(i < n)
    {
        if(arr1[i] != flag)
        {
            flag = arr1[i];
            cout << arr1[i++] << " ";
        }
        else
            i++;
    }
    while(j < m)
    {
        if(arr2[j] != flag)
        {
            flag = arr2[j];
            cout << arr2[j++] << " ";
        }
        else
            j++;
    }
    cout << endl;
    // Finding intersection
    i = 0;
    j = 0;
    cout << "Intersection of the two arrays: ";
    while(i < n && j < m)
    {
        if(arr1[i] == arr2[j])
        {
            cout << arr1[i++] << " ";
            j++;
        }
        else if(arr1[i] < arr2[j])
            i++;
        else
            j++;
    }
return 0;
}