We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents c25c1f0 + 3601683 commit 3c3d0f8Copy full SHA for 3c3d0f8
maths/fibonacci.py
@@ -212,14 +212,11 @@ def fib_binet(n: int) -> list[int]:
212
return [round(phi**i / sqrt_5) for i in range(n + 1)]
213
214
215
-
216
217
if __name__ == "__main__":
218
num = 30
219
time_func(fib_iterative, num)
220
time_func(fib_recursive, num) # Around 3s runtime
221
time_func(fib_recursive_cached, num) # Around 0ms runtime
222
time_func(fib_memoization, num)
223
time_func(fib_binet, num)
224
- time_func(fib_iterative_yield, num)
225
+ time_func(fib_iterative_yield, num)
0 commit comments