Recursion in java

[Xmen]

Hi
I am trying to write an static recursive method that returns the occurrence a particular digit d in an integer n. For example, if passed (1342457,4) it should return 2, whereas when passed (1342457,6) it should return 0. This is not my actual code and it will not sound like that, I just want help with the logic in this. I can't grasp what needs to be done. i should also take care of that no variables are other than the two that the user will input as the integer, and the digit to be checked for.

[Zecho]

Hi
I think you need to use at least one more variable. I think you should read the integer in as a string. Create an array of all it's char's and then compare each one to the digit. Hope this will solve your problem. If not do post back again.

[Xmen]

Hi
Thanks for replying. I will take care of what you have said. I am posting my code below see if you can help me.

// Returns the largest element in an integer array
public static int maxa(int[] a, int size)
{
if (size==1)
return (a[0]);
else
{
int temp = maxa(a, size-1);
if(temp>a[size-1])
return temp;
else
return a[size-1];
}
}