Fibonacci is an easy problem to know that you implemented the recursive form correctly (easy to check the answer), and the recursion is a very simple way to tes

Fibonacci is an easy problem to know that you implemented the recursive form correctly (easy to check the answer), and the recursion is a very simple way to test the speed of function calls. So it's a very reproducible way to test the speed of some of the internals.