Practice: Recursion

Take out a piece of paper. We’ll be programming on paper.

Problem 1

Write a method fibonacci that takes an integer parameter N and returns the N^th fibonacci number.

Fibonacci numbers are defined by the formula F_n = F_{n - 1} + F_{n - 2}. The Fibonacci sequence starts with F₀ = 0 and F₁ = 1.

The first 10 Fibonacci numbers are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34.

Problem 2

Start to write a method

public void printAnagrams(String prefix, String word)

Implement the base case for the recursion.

if word length is one
  Print the prefix and word

Show me your code.