Hello everyone.

i got some homework i have no idea how to solve.

so, if you can help me out a bit, that would be great.

i'm not asking you to solve it for me, of course.

** No loops or pointers allowed.

i need to write a function that gets 2 arrays of integers and their sizes and returns the amount of numbers repeating.

for example:

1,9,5,4

5,10,18,1,3

will return 2 (for 5 and 1);

the declartaion:

int intersect (const int arr1[],const in arr2[],int size1,int size2,....);

(it's allowed to use more arguments in the function).

Loops - Not allowed (for,do,while)

side functions are allowed.

every function that assists this one, must be recursive.

assume the length of each array is 20 at most.

guys, i don't even have a clue where to begin

any kind of advice would be appritiated!

Thanks!!