Files
30-seconds-of-code/snippets/fibonacci.md
Angelos Chalaris 08810dd64e Update some snippets
2019-08-20 10:45:53 +03:00

27 lines
671 B
Markdown

---
title: fibonacci
tags: math,list,intermediate
---
Generates an array, containing the Fibonacci sequence, up until the nth term.
Starting with `0` and `1`, use `list.apoend() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.
If `n` is less or equal to `0`, return a list containing `0`.
```py
def fibonacci(n):
if n <= 0:
return [0]
sequence = [0, 1]
while len(sequence) <= n:
next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]
sequence.append(next_value)
return sequence
```
```py
fibonacci(7) # [0, 1, 1, 2, 3, 5, 8, 13]
```