Consider the iterative version of the fib method from the textbook shown below:
Public static long fib(int n)
{
If (n

Question

Consider the iterative version of the fib method from the textbook shown below:
Public static long fib(int n)
{
If (n <= 2)
{
Return 1;
}
Long fold = 1;
Long fold2 = 1;
Long fnew = 1;
For (int i = 3; i <= n; i++)
{
Fnew = fold + fold2;
Fold2 = fold;
Fold = fnew;
}
Return fnew;
}
How many iterations of the for loop will there be for the call fib(6)?
A) 6
B) 5
C) 4
D) 3

Quizplus · Accepted Answer

For the call fib(6), the loop will iterate 4 times. The for loop starts at i=3 and continues until i<=6, which means there will be 4 iterations. Therefore, the best choice is C.

Consider the Iterative Version of the Fib Method from the Textbook