Finds fibonacci number in index k. Parameters ---------- k : Index of fibonacci. Returns ------- int Fibonacci number in position k. >>> fibonacci(0) 0 >>> fibonacci(2) 1 >>> fibonacci(5) 5 >>> fibonacci(15) 610 >>> fibon
(k: int)
| 16 | |
| 17 | @lru_cache |
| 18 | def fibonacci(k: int) -> int: |
| 19 | """Finds fibonacci number in index k. |
| 20 | |
| 21 | Parameters |
| 22 | ---------- |
| 23 | k : |
| 24 | Index of fibonacci. |
| 25 | |
| 26 | Returns |
| 27 | ------- |
| 28 | int |
| 29 | Fibonacci number in position k. |
| 30 | |
| 31 | >>> fibonacci(0) |
| 32 | 0 |
| 33 | >>> fibonacci(2) |
| 34 | 1 |
| 35 | >>> fibonacci(5) |
| 36 | 5 |
| 37 | >>> fibonacci(15) |
| 38 | 610 |
| 39 | >>> fibonacci('a') |
| 40 | Traceback (most recent call last): |
| 41 | TypeError: k must be an integer. |
| 42 | >>> fibonacci(-5) |
| 43 | Traceback (most recent call last): |
| 44 | ValueError: k integer must be greater or equal to zero. |
| 45 | """ |
| 46 | if not isinstance(k, int): |
| 47 | raise TypeError("k must be an integer.") |
| 48 | if k < 0: |
| 49 | raise ValueError("k integer must be greater or equal to zero.") |
| 50 | if k == 0: |
| 51 | return 0 |
| 52 | elif k == 1: |
| 53 | return 1 |
| 54 | else: |
| 55 | return fibonacci(k - 1) + fibonacci(k - 2) |
| 56 | |
| 57 | |
| 58 | def fibonacci_search(arr: list, val: int) -> int: |