X459: Review - Fibonacci

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, characterized by the fact that every number after the first two is the sum of the two preceding ones:

0, 1, 1, 2, 3, 5, 8, 13, ...

Write a recursive function that the returns the nth fibonacci number.

Examples:

fibonacci(0) -> 0

fibonacci(1) -> 1

fibonacci(7) -> 13

Your Answer:

Feedback

Your feedback will appear here when you check your answer.