Recursive Fibonacci - Byte Sized C++

Recursion

19.5 - Recursive Fibonacci

The Fibonacci numbers, denoted F_n can be calculated recursively. It follows this rule:

F₀ = 0
F₁ = 1
F_n = F_n-1 + F_n-2

Task

Define the function int fibonacci(int n) which gives the nth Fibonacci number by using recursion.

Define the base cases for 0 and 1.
Define the recursion cases.

#include <iostream> int fibonacci(int n) { // Define this function. } int main() { int n{}; std::cin >> n; std::cout << fibonacci(n) << std::endl; }