Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.

>> REGISTER NOW TO START POSTING

# Thread: Problem with fairly basic recursive method

1. ## Problem with fairly basic recursive method

The point of my code is to find the answer of logbn. 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;
}

bumpppppppp

3. ## Re: Problem with fairly basic recursive method

1) Do not bump your post...for a vast number of reasons it may even affect your chances of receiving help. 2) Do not post your same question twice. I am locking this thread.
http://www.javaprogrammingforums.com...-you-help.html