FilesExpand file tree

 master

/

intersection_array.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

30 lines (22 loc) · 477 Bytes

 master

/

intersection_array.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

30 lines (22 loc) · 477 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

#include <iostream>

using namespace std;

void intersect(int A[], int B[], int N1, int N2){

int i = 0, j =0;

while(1){

while(A[i]<B[j] && i<N1)i++;

while(B[j]<A[i] && j<N2)j++;

if(i>=N1||j>=N2)break;

if(A[i]==B[j]){

cout<<A[i]<<endl;

i++,j++;

}

}

}

int main(){

int A[] = {4,5,6,7,8,9,33};

int B[] = {4,5,7,8,9,33};

int N1 = 7;

int N2 = 6;

intersect(A, B, N1, N2);

return 0;

}