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

1 vote175 views1 answer
C++ concurrency
C++
0 vote190 views1 answer
Matrix dynamic memory c++
C++
13 votes195 views5 answers
C++ iterate map
C++
1 vote172 views3 answers
How to get a random number between two numbers in c++
C++
14 votes202 views2 answers
How to sort in descending order in c++
C++
2 votes218 views1 answer
How to find typein c++
C++
0 vote173 views1 answer
C function as paramter
C++
0 vote279 views1 answer
Statement that causes a function to end in c++
C++
0 vote258 views5 answers
Return tuple or null
C++
0 vote165 views1 answer
Print maximum sum subarray
C++