Recursion, Fibonacci sequence

recursive

1. Concept and basic use

common problem ： Failure to terminate statistics resulted in an error , Stack overflow

Examples are as follows ：

Case study ：1-n Cumulative home and

2. Four features of recursion

1. There must be a terminable condition , Otherwise, the program will fall into an infinite loop ;

2. The subproblem is smaller in scale than the original problem , Or closer to the termination condition ;

3. The subproblem can be solved directly by recursively calling the solution process again or meeting the termination condition 2 ;

4. The solution of the subproblem should be combined into the solution of the whole problem .

3. skill

Find the recursive part and the termination part of the recursive implementation  

Fibonacci series

Fibonacci：1,1,2,3,5,8,13,21,34,55,89.......

Termination part ：F1=1,F2=1;

Recursive part ：F(n)=F(n-1)+F(n-2), among n>2.

Fibonacci series