**引荐一遍特别好的文章:**http://www.jb51.net/article/81506.htm**推荐讲斐波那契数列视频,很有激情、多角度很全面:**http://m.open.163.com/movie?plid=M9HKRT25D&rid=M9HNA0UNO
Many of the problems caused by the Fibonacci sequence know that a lot of knowledge needs to be considered and summed up
For the math is OK, the algorithm has the basis of a look to understand, but some people do not understand, the final step by step to do the analysis is clear, the principle of understanding the grammar you are free:
Based on recursion (Fibonacci that tangent sequence):
In fact, this is so simple, handwriting a bit messy, with the number in it, after all, when recursive to the last n<=2 will have a return value (also conform to recursive 1, call the function itself 2, there is a return value), inappropriate description is to peel onions, but also a layer of release.
So much so that there are many kinds of lambda,while in grammar.
Python story--three (attached)