Recursion and Efficiency
Overhead associated with function calls and the inherent inefficiency of some recursive algorithms contribute to inefficiency in some recursive solutions.
Example for inherent inefficiency: Rabbit(n) = Rabbit(n-1) + Rabbit(n-2);
Recursion is not always appropriate, particularly when a clear, efficient iterative solution exists.
True value of recursion is as a way to solve problems for which there is is no simple nonrecursive solutions.