MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / fibonacci

Function fibonacci

project_euler/problem_25/sol1.py:8–18  ·  view source on GitHub ↗
(n)

Source from the content-addressed store, hash-verified

6 xrange = range #Python 3
7
8def fibonacci(n):
9 if n == 1 or type(n) is not int:
10 return 0
11 elif n == 2:
12 return 1
13 else:
14 sequence = [0, 1]
15 for i in xrange(2, n+1):
16 sequence.append(sequence[i-1] + sequence[i-2])
17
18 return sequence[n]
19
20def fibonacci_digits_index(n):
21 digits = 0

Callers 1

fibonacci_digits_indexFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected