docs: clean up docstring in fib_recursive function

Author: sharvandeep

maths/fibonacci.py

@@ -89,11 +89,36 @@ def fib_iterative(n: int) -> list[int]:
 
 
 def fib_recursive(n: int) -> list[int]:
+        """
+    Calculate the first n (0-indexed) Fibonacci numbers using recursion.
+
+    Args:
+        n (int): The number of Fibonacci terms to generate.
+
+    Returns:
+        list[int]: A list of the first n Fibonacci numbers.
+
+    Examples:
+        >>> fib_recursive(0)
+        [0]
+        >>> fib_recursive(1)
+        [0, 1]
+        >>> fib_recursive(5)
+        [0, 1, 1, 2, 3, 5]
+        >>> fib_recursive(-1)
+        Traceback (most recent call last):
+            ...
+        ValueError: n is negative
     """
-    Calculates the first n (0-indexed) Fibonacci numbers using recursion
-    >>> fib_iterative(0)
-    [0]
-    >>> fib_iterative(1)
+
+    def fib_recursive_term(i: int) -> int:
+        """
+        Calculates the i-th (0-indexed) Fibonacci number using recursion
+        >>> fib_recursive_term(0)
+        0
+        >>> fib_recursive_term(1)
+        1
+ >>> fib_iterative(1)
     [0, 1]
     >>> fib_iterative(5)
     [0, 1, 1, 2, 3, 5]
@@ -112,6 +137,8 @@ def fib_recursive_term(i: int) -> int:
         0
         >>> fib_recursive_term(1)
         1
+        >>> fib_recursive_term(5)
+
         >>> fib_recursive_term(5)
         5
         >>> fib_recursive_term(10)