Introduction - If you have any usage issues, please Google them yourself
f (n) = f (n-1)+ f (n-2) f (0) = f (1) = 1, Item 20 seeking Fibonacci number Fibonacci sequence that were circulating and recursively, more time effectiveness. Tip: You can use the c function Remove the current system clock time, before and after the calculation each time, twice per second relative to the clock deduction, you can get in seconds gap