@Test public void fourthNumberInFibonacciSequenceIsThreeRecursive() { assertEquals(5, fibonacciNumbers.getRecursive(4)); }
public int getRecursive(int n) { validateInput(n); if (n == 0 || n == 1) { return 1; } else { return getRecursive(n - 1) + getRecursive(n - 2); } }
FibonacciNumbers { public int getRecursive(int n) { validateInput(n); if (n == 0 || n == 1) { return 1; } else { return getRecursive(n - 1) + getRecursive(n - 2); } } }
FibonacciNumbers { public int getRecursive(int n) { validateInput(n); if (n == 0 || n == 1) { return 1; } else { return getRecursive(n - 1) + getRecursive(n - 2); } }  }
FibonacciNumbers { public int getRecursive(int n) { validateInput(n); if (n == 0 || n == 1) { return 1; } else { return getRecursive(n - 1) + getRecursive(n - 2); } }  int getRecursive(int n); int getIterative(int n); int getRecursiveWithCatching(int n); }
FibonacciNumbers { public int getRecursive(int n) { validateInput(n); if (n == 0 || n == 1) { return 1; } else { return getRecursive(n - 1) + getRecursive(n - 2); } }  int getRecursive(int n); int getIterative(int n); int getRecursiveWithCatching(int n);  }