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 vote184 views1 answer
Fabs c c++
C++
0 vote167 views1 answer
Equalize problem codeforces
C++
0 vote168 views1 answer
Turbo c++ easy programs
C++
1 vote172 views1 answer
Std::tuple apply multiplier
C++
0 vote198 views1 answer
C++ chrono get milliseconds
C++
0 vote167 views1 answer
Std::ifstream cant read file to large
C++
0 vote178 views2 answers
C++ server service ros
C++
0 vote166 views1 answer
Appending int to string in cpp
C++
3 votes191 views2 answers
Find maximum sum in array of contiguous subarrays
C++
1 vote169 views1 answer
Enumerate with letters latex
C++