For example I have: [1 3; 2 4; 2 5; 3 3] and would like to have: [(1,3);(2,4);(2,5);(3,3)]
I actually need to take two arrays (k,2) and count how many pairs are the same. for example if I have: A = [1 3; 2 4; 2 5; 3 5] and B = [2 3; 2 1; 2 4; 3 5] I want the answer to be 2. Since as a sets of 4 ordered pairs (each), the intersection of A and B contains two elements.
Thanks!
Best Answer