Computes the nth Fibonacci recursively. This becomes computationally intensive for larger values of n.
1 | naive_fibonacci(n, accumulate = FALSE)
|
n |
An integer representing the desired element of the series to return. |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.