C++ Tutorials
111. C++ Recursion function explained using Fibonacci series
By: Emiley J : 2007-09-04
Description: A function can call itself. This is called recursion, and recursion can be direct or indirect. It is direct when a function calls itself; it is indirect recursion when a function calls another function that then calls the first function.