Solving Fibonacci Sequence by recursive method

1, Fibonacci sequence refers to: 1,1,2,3,5,8,13,21,34......fibonacci law is, starting from the 3rd number, each number is its front two number of the and. So how to solve any nth number of Fibonacci by programming???

The recursive method is a channel to solve the problem.

The so-called recursion, refers to the function can call itself, such a call can be direct or indirect.

#include <iostream>using namespacestd;intFib (intn);intMain () {intN; intanswer; cout<<"Please input a number n:\n"<<Endl; CIN>>N; Answer=Fib (n); cout<<"The Fibnacci of"<<n<<" is"<<answer<<Endl; System ("PAUSE"); return 0;}intFib (intN) {    if(n<3)//recursive end condition {return 1; }    Else    {        returnFib (n1) +FIB (n2);//Recursive Call}}

2, the detailed call process is also a very interesting thing, see "21 days Learn C + +" P90.

Solving Fibonacci Sequence by recursive method