Consider the method powerOfTwo shown below:
Public boolean powerOfTwo(int n)
{
If (n == 1) // line #1
{
Return true;
}
Else if (n % 2 == 1) // line #2
{
Return false;
}
Else
{
Return powerOfTwo(n / 2); // line #3
}
}
How many recursive calls are made from the original call of powerOfTwo(64) (not including the original call)?
A) 8
B) 6
C) 4
D) 2

Question

Quizplus · Accepted Answer

When we call powerOfTwo(64), it will call powerOfTwo(32) in line #3, then powerOfTwo(16) in line #3, then powerOfTwo(8), powerOfTwo(4), powerOfTwo(2), and finally powerOfTwo(1) in line #1. Thus, there are 6 recursive calls made.

Consider the Method PowerOfTwo Shown Below