The Fibonacci sequence of recursion

Mathematically, the number of charges is defined in a recursive way:

• (n≧2)

In words, the Fibonacci sequence begins with 0 and 1, and then the Fibonacci sequence is added from the previous two numbers.

This is also from Wikipedia on the expression, comparative professional points. The simple one is to write the previous few:

0,1,1,2,3,5,8,13,21,34,55,89,144,233 ......

This is also an exponential growth phenomenon, so if rabbits all grow at this rhythm, then every day there is meat to eat, but also cheap!!!

This problem is relative to the Hanoi tower problem, compared to me and, Fibonacci sequence at a glance, a good understanding of the comparison.

Let's use Ptyhon to achieve this:

def fib (x):    assert type (x) = = int and x >= 0    if x = = 0 or X = = 1:        return 1    else:        return fib (x-1) + FIB (x-2)

Just say python a few lines of code to get it done.

The Fibonacci sequence of recursion