How to Compute the Fibonacci Number Recursively

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);}
Share the Post:
Share on facebook
Share on twitter
Share on linkedin

Related Posts