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 vote207 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
0 vote223 views1 answer
Parenthesis Checker using stack in c++
C++
0 vote197 views1 answer
Unordered_set to vector
C++
1 vote203 views1 answer
How to make sure the user inputs a int and not anything else c++
C++
-3 votes220 views1 answer
Array c plus plus
C++
4 votes205 views4 answers
Get list of files in directory c++
C++
1 vote207 views1 answer
String input with space c++ stl
C++
4 votes220 views1 answer
How to delete a 2d dynamic array in c++
C++
0 vote199 views1 answer
How to point to next array using pointer c++
C++
0 vote233 views1 answer
C++ if bool true
C++