[CTphpnwb]

chenfire, on 22 March 2013 - 12:18 PM, said:

you didn't look at evryting I wrote right? />

Wrong. Your call from main() would need to be in a loop because your function is not recursive.

[chenfire]

well, here is my view so far:
lets say that these are the inputs:
n1[]={1,0,1,1}
n2[]={1,1,0,1}
length=4

so we send to the function:(n1,n2,length-1).

f(3)=0+f(2)
f(2)=2+f(1)
f(1)=2*2 +f(0)
f(0)=0+f(-1)
f(-1)=0

we will stop when length==-1, because if we will stop at 0,we will "loose" f(0), that might be not zero.

but without static variables, how can i do it?

thanks

[chenfire]

well i think that I have solved it:

int binaryXor(int firstnumber[],int secondnumber[],int length){
	if(length==-1) return 0;
	if(firstnumber[length]!=secondnumber[length])
		return 1+2*binaryXor(firstnumber,secondnumber,length-1);
	return 2*binaryXor(firstnumber,secondnumber,length-1);

Am I right?

[Skydiver]

You can find out for yourself whether it is correct or not by testing your code with various values.