5 examples of 'fibonacci series in python without recursion' in Python

6
def test_fib(self, func):
7
    result = []
8
    expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
9
    for i in range(len(expected)):
10
        result.append(func(i))
11
    assert_equal(result, expected)
12
    print('Success: test_fib')

14
def fibonacci(x: int):
15
    if x < 0:
16
        return -1
17
    if x == 0:
18
        return 0
19
    cache = [0] * (x + 1)
20
    for i in range(1, len(cache)):
21
        cache[i] = -1
22
    cache[1] = 1
23
    return fibonacci_recur(x, cache)

6
def py_fibonacci(n):
7
    """https://stackoverflow.com/a/52133289/2536357"""
8
    i = 0
9
    nextterm = 1
10
    present = 1
11
    previous = 0
12
13
    while i < n:
14
        nextterm = present + previous
15
        present = previous
16
        previous = nextterm
17
        i = i + 1
18
19
    return nextterm

37
@tasklets.tasklet
38
def fibonacci(n):
39
  """A recursive Fibonacci to exercise task switching."""
40
  if n <= 1:
41
    raise tasklets.Return(n)
42
  a = yield fibonacci(n - 1)
43
  b = yield fibonacci(n - 2)
44
  raise tasklets.Return(a + b)

6
def fibonacci_partial_sum_naive(from_, to):
7
    if to <= 1:
8
        return to
9
10
    previous = 0
11
    current = 1
12
13
    for _ in range(from_ - 1):
14
        previous, current = current, previous + current
15
16
    sum = current
17
18
    for _ in range(to - from_):
19
        previous, current = current, previous + current
20
        sum += current
21
22
    return sum % 10