Question

Complete java program below.

Complete non-recursive version nthFibonacciWithLoop() method.

Complete recursive version nthFibonacciWithRecursion() method.

public class Fibonacci {

// Fib(N): N N = 0 or N = 1

// Fib(N-1) + Fib(N-2) N > 1

// For example,

// Fib(0) = 0

// Fib(1) = 1

// Fib(2) = Fib(1) + Fib(0) = 1 + 0 = 1

// Fib(3) = Fib(2) + Fib(1) = Fib(2) + 1 = (Fib(1) + Fib(0)) + 1 = 1 + 0 + 1 =

2

// ...

// Fib(10) = (0), 1, 1, 2, 3, , 5, 8, 13, 21, 34, 55, ...

// Return the nth Fibonacci number.

public static int nthFibonacciWithLoop(int nth) {

}

public static int nthFibonacciWithRecursion(int nth) {

}

// Check first 30 Fibonicci numbers.

private static void check() {

int [] check = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377,

610, 987, 1597, 2584, 4181, 6765};

boolean correctLoop = true, correctRecursion = true;

for (int i = 0; i < 20; i++) {

if (nthFibonacciWithLoop(i) != check[i])

correctLoop = false;

if (nthFibonacciWithRecursion(i) != check[i])

correctRecursion = false;

}

if (correctLoop && correctRecursion)

System.out.println("\nYou got them right!");

else {

if (!correctLoop)

System.out.println("\nCheck nthFibonacciWithLoop()");

if (!correctRecursion)

System.out.println("\nCheck nthFibonacciWithRecursion()");

}

}

public static void main(String [] args) {

System.out.print("Enter N: ");

int n = new java.util.Scanner(System.in).nextInt();

for (int i = 0; i <= n; i++) {

System.out.print(nthFibonacciWithLoop(i) + " ");

}

System.out.println();

for (int i = 0; i <= n; i++) {

System.out.print(nthFibonacciWithRecursion(i) + " ");

}

check();

}

}

Answer 1

Code

public class Fibonacci
{
// Fib(N): N N = 0 or N = 1
// Fib(N-1) + Fib(N-2) N > 1
// For example,
// Fib(0) = 0
// Fib(1) = 1
// Fib(2) = Fib(1) + Fib(0) = 1 + 0 = 1
// Fib(3) = Fib(2) + Fib(1) = Fib(2) + 1 = (Fib(1) + Fib(0)) + 1 = 1 + 0 + 1 =2
// ...
// Fib(10) = (0), 1, 1, 2, 3, , 5, 8, 13, 21, 34, 55, ...
// Return the nth Fibonacci number.
public static int nthFibonacciWithLoop(int nth)
{
int a = 0, b = 1, c;
if (nth == 0)
return a;
for (int i = 2; i <= nth; i++) {
c = a + b;
a = b;
b = c;
}
return b;
}
public static int nthFibonacciWithRecursion(int nth)
{
if (nth <= 1)
return nth;
return nthFibonacciWithRecursion(nth - 1) + nthFibonacciWithRecursion(nth - 2);
}
// Check first 30 Fibonicci numbers.
private static void check()
{
int [] check = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377,
610, 987, 1597, 2584, 4181, 6765};
boolean correctLoop = true, correctRecursion = true;
for (int i = 0; i < 20; i++)
{
if (nthFibonacciWithLoop(i) != check[i])
correctLoop = false;
if (nthFibonacciWithRecursion(i) != check[i])
correctRecursion = false;
}
if (correctLoop && correctRecursion)
System.out.println("\nYou got them right!");
else
{
if (!correctLoop)
System.out.println("\nCheck nthFibonacciWithLoop()");
if (!correctRecursion)
System.out.println("\nCheck nthFibonacciWithRecursion()");
}
}
public static void main(String [] args)
{
System.out.print("Enter N: ");
int n = new java.util.Scanner(System.in).nextInt();
for (int i = 0; i <= n; i++)
{
System.out.print(nthFibonacciWithLoop(i) + " ");
}
System.out.println();
for (int i = 0; i <= n; i++)
{
System.out.print(nthFibonacciWithRecursion(i) + " ");
}
check();
}
}

output

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.