Shulou(Shulou.com)06/01 Report--

This article mainly introduces how to use Python to solve the Fibonacci series n related knowledge, the content is detailed and easy to understand, the operation is simple and fast, has a certain reference value, I believe that you will have something to gain after reading this article on how to use Python to solve the n term of Fibonacci series, let's take a look.

Algorithm 1: recursion

Recursive calculation of the number of nodes is O (2) level, the efficiency is very low, there are a large number of repeated calculations.

For example:

F (10) = f (9) + f (8)

F (9) = f (8) + f (7) repeat 8

F (8) = f (7) + f (6) repeat 7

The time complexity is O (2 minutes), very slow.

Def F1 (n): if n

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.