Thread: Problem with recursive method. Can you help?

The point of my code is to find the answer of log_bn. I am stuck on the part where a is incremented. I'm not exactly sure where to increment it because every value input will return 1. Any advice? Thanks!
So here is my code.


/**
* Calculates base-b log of n recursively
* @param b the base of the logarithm to be found
* @param n the value whose logarithm is being found
* @return base b log of n
* Pre-Condition: n must be integer multiple of b
* @since Lesson 6-4
* @version 12-6-11
* @author TFLeGacY
*/
public int log(int b, int n)
{ int a = 0;
if(n / b == 1)
return 1;
else
{ log(b, n = n / b);
a++;
}
return a;
}

One of your problems could be due to integer division. There are no fractions. 10/6 = 1

Another problem could be the lack of storing return values

The OP needs to post the algorithm that the code is supposed to implement.

Thanks so much for the help you guys! It got it working great! In case you were curious, here is the code that calculates the base-b log of n.

public int log(int b, int n)
{ if(n / b == 1)
return 1;
else
{ return 1 + log(b, n = n / b);
}
}

You should be aware that your solution whilst working has a couple of redundant features, I'd recommend having a think about what they might be if you want to excel in programming and problem solving

Chris

@Freaky Chris, the last post I put up was the exact answer for my homework. I do plan on excelling in programming and I just wanted to let you know that this code was simply an assignment.