Calculates the i-th (0-indexed) Fibonacci number using recursion >>> fib_recursive_term(0) 0 >>> fib_recursive_term(1) 1 >>> fib_recursive_term(5) 5 >>> fib_recursive_term(10) 55 >>> fib_recursive_term(-1) Trace
(i: int)
| 106 | """ |
| 107 | |
| 108 | def fib_recursive_term(i: int) -> int: |
| 109 | """ |
| 110 | Calculates the i-th (0-indexed) Fibonacci number using recursion |
| 111 | >>> fib_recursive_term(0) |
| 112 | 0 |
| 113 | >>> fib_recursive_term(1) |
| 114 | 1 |
| 115 | >>> fib_recursive_term(5) |
| 116 | 5 |
| 117 | >>> fib_recursive_term(10) |
| 118 | 55 |
| 119 | >>> fib_recursive_term(-1) |
| 120 | Traceback (most recent call last): |
| 121 | ... |
| 122 | ValueError: n is negative |
| 123 | """ |
| 124 | if i < 0: |
| 125 | raise ValueError("n is negative") |
| 126 | if i < 2: |
| 127 | return i |
| 128 | return fib_recursive_term(i - 1) + fib_recursive_term(i - 2) |
| 129 | |
| 130 | if n < 0: |
| 131 | raise ValueError("n is negative") |
no outgoing calls
no test coverage detected