Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,894 questions

51,825 answers

573 users

How to show only numbers that are present in two int arrays (intersect the ranges) in C++

1 Answer

0 votes
#include <iostream>
#include <algorithm>
#include <iterator>

using std::cout;
using std::endl;

int main()
{
	int arr1[] = { 1, 2, 3, 3, 5, 6, 7, 7, 8, 999 };
	int len1 = sizeof(arr1) / sizeof(int);

	int arr2[] = { 2, 3, 3, 3, 7, 7, 8, 9 };
	int len2 = sizeof(arr2) / sizeof(int);

	set_intersection(arr1, arr1 + len1, arr2, arr2 + len2, std::ostream_iterator<int>(cout, " "));

	cout << endl;

	return 0;
}

/*
run:

2 3 3 7 7 8

*/

 



answered Mar 2, 2018 by avibootz
...