andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update some snippets

Browse Source
This commit is contained in:
Angelos Chalaris
2019-08-20 10:45:53 +03:00
parent 8a0fd59a72
commit 08810dd64e
7 changed files with 31 additions and 101 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
snippets/fibonacci.md
View File

@ -1,23 +1,24 @@
---
title: fibonacci
tags: math
tags: math,list,intermediate
---
Generates an array, containing the Fibonacci sequence, up until the nth term.
Starting with 0 and 1, adds the sum of the last two numbers of the list to the end of the list using ```list.append()``` until the length of the list reaches n. If the given nth value is 0 or less, the method will just return a list containing 0.
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]
if n <= 0:
return [0]
sequence = [0, 1]
while len(sequence) <= n:
# Add the sum of the previous two numbers to the sequence
next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]
sequence.append(next_value)
sequence = [0, 1]
while len(sequence) <= n:
next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]
sequence.append(next_value)
return sequence
return sequence
```
```py