The following code shows you how to compute the n Fibonacci number recursively:
int fibonacci(int k) { if (k return k; } return fibonacci(k - 2) + fibonacci(k - 1); }
