Intersection.cpp

#include"iostream"

using namespace std;


int A[] = {2, 4, 3, 5, 6, 7};
int B[] = {9, 2, 7, 6};

int main()
{
    int sizeA = sizeof(A)/sizeof(int);

    int sizeB = sizeof(B)/sizeof(int);

    int big =  (sizeA > sizeB) ? sizeA : sizeB;

    int small =  (sizeA > sizeB) ? sizeB : sizeA;

    for (int i = 0; i <big ;++i)
    {
        for (int j = 0; j <small ; ++j)
        {
            if(A[i] == B[j])
            {
                cout<<"Element is -->"<<A[i]<<endl;
            }
        }
    }

    return 0;
}

Source: stackoverflow.com

Similar codes

0 vote347 views1 answer
Iteraate through a vector
C++
20 votes319 views4 answers
Cin getline
C++
37 votes403 views2 answers
Remove element by index from vector c++
C++
0 vote343 views1 answer
Do c++ ints neeed to be initlaized
C++
4 votes297 views1 answer
Log base e synthax c++
C++
12 votes302 views2 answers
Comparator in sort c++
C++
0 vote316 views1 answer
16630147
C++
11 votes324 views3 answers
C++ map iterator
C++
22 votes322 views6 answers
Sort array in descending order c++
C++
1 vote338 views1 answer
How to delete an element in vector pair in cpp
C++