algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix incorrect doctest references in fibonacci functions (#14200)

Browse Source 
* Fix incorrect doctest references in fibonacci functions

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
This commit is contained in:
Shivang Arya
2026-03-09 10:19:15 +05:30
committed by GitHub
parent f5c3e7c808
commit 1ae906a97b
1 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
maths/fibonacci.py
View File

@@ -91,15 +91,15 @@ def fib_iterative(n: int) -> list[int]:
def fib_recursive(n: int) -> list[int]:
"""
Calculates the first n (0-indexed) Fibonacci numbers using recursion
>>> fib_iterative(0)
>>> fib_recursive(0)
[0]
>>> fib_iterative(1)
>>> fib_recursive(1)
[0, 1]
>>> fib_iterative(5)
>>> fib_recursive(5)
[0, 1, 1, 2, 3, 5]
>>> fib_iterative(10)
>>> fib_recursive(10)
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
>>> fib_iterative(-1)
>>> fib_recursive(-1)
Traceback (most recent call last):
...
ValueError: n is negative
@@ -119,7 +119,7 @@ def fib_recursive(n: int) -> list[int]:
>>> fib_recursive_term(-1)
Traceback (most recent call last):
...
Exception: n is negative
ValueError: n is negative
"""
if i < 0:
raise ValueError("n is negative")
@@ -135,15 +135,15 @@ def fib_recursive(n: int) -> list[int]:
def fib_recursive_cached(n: int) -> list[int]:
"""
Calculates the first n (0-indexed) Fibonacci numbers using recursion
>>> fib_iterative(0)
>>> fib_recursive_cached(0)
[0]
>>> fib_iterative(1)
>>> fib_recursive_cached(1)
[0, 1]
>>> fib_iterative(5)
>>> fib_recursive_cached(5)
[0, 1, 1, 2, 3, 5]
>>> fib_iterative(10)
>>> fib_recursive_cached(10)
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
>>> fib_iterative(-1)
>>> fib_recursive_cached(-1)
Traceback (most recent call last):
...
ValueError: n is negative
@@ -176,7 +176,7 @@ def fib_memoization(n: int) -> list[int]:
[0, 1, 1, 2, 3, 5]
>>> fib_memoization(10)
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
>>> fib_iterative(-1)
>>> fib_memoization(-1)
Traceback (most recent call last):
...
ValueError: n is negative