Skip to content

Added Union of two sorted arrays solution #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
SR-Sunny-Raj merged 1 commit into from
Oct 5, 2021
Merged

Added Union of two sorted arrays solution #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 36 additions & 0 deletions HacktoberFest2021/C++ Programs/union_of_two_sorted_arrays.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
// C++ program for the union of two arrays using Set
#include <bits/stdc++.h>
using namespace std;
void getUnion(int a[], int n, int b[], int m)
{

// Defining set container s
set<int> s;

// Inserting array elements in s
for (int i = 0; i < n; i++)
s.insert(a[i]);

for (int i = 0; i < m; i++)
s.insert(b[i]);
cout << "Number of elements after union operation: " << s.size() << endl;
cout << "The union set of both arrays is :" << endl;
for (auto itr = s.begin(); itr != s.end(); itr++)
cout << *itr << " ";
// s will contain only distinct elements from array a and b
}

// Driver Code
int main()
{ int n,m;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
cin>>m;
int b[m];
for(int i=0;i<m;i++)
cin>>b[i];
getUnion(a, n, b, m);
}

Binary file added HacktoberFest2021/C++ Programs/union_of_two_sorted_arrays.exe
View file
Open in desktop
Binary file not shown.